Patents by Inventor Gannady Lapir
Gannady Lapir has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 9159584Abstract: Methods and Systems of Retrieving Documents. Coding a plurality of stored documents as respective document feature vectors in a bit-attribute matric, each feature vector comprising an attribute or class. Generating a query vector based on a query document. Performing one or more logical operations between the query vector and the respective document features vectors in the bit-attribute matrix to obtain respective similarity measures. Assigning an attribute or class to the query document based on the attribute or classes of one or more of the feature vectors.Type: GrantFiled: May 22, 2012Date of Patent: October 13, 2015Inventors: Gannady Lapir, Harry Urbshat
-
Publication number: 20120296933Abstract: A computer-implemented method comprising retrieving documents in response to an input query based on a similarity measure.Type: ApplicationFiled: May 22, 2012Publication date: November 22, 2012Applicant: BDGB ENTERPRISE SOFTWARE S.A.R.L.Inventors: Gannady LAPIR, Harry Urbshat
-
Patent number: 8209481Abstract: A system of retrieving documents comprising: coding a plurality of stored documents as a respective document feature vector; generating a query feature vector based on a query document; and performing one or more logical operations between the query feature vector and the document feature vector to obtain respective similarity measures.Type: GrantFiled: February 9, 2011Date of Patent: June 26, 2012Assignee: BDGB Enterprise Software S.A.R.LInventors: Gannady Lapir, Harry Urbshat
-
Publication number: 20120011131Abstract: A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said method comprising: coding each document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document; arranging the feature vectors in a matrix; generating a query feature vector based on the query document and, according to the rules used for generating the feature vectors corresponding to the stored documents such that the query vector corresponds in its length to the width of the matrix; storing the matrix column-wise; for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more of preferably hardware supported logical operations between the columns of the matrix to obtain one or more, additional result columns coding for a similarity measure betType: ApplicationFiled: February 9, 2011Publication date: January 12, 2012Applicant: BDGB ENTERPRISE SOFTWARE S.A.R.LInventors: Gannady Lapir, Harry Urbshat
-
Patent number: 7908430Abstract: A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said method comprising: coding each document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document; arranging the feature vectors in a matrix; generating a query feature vector based on the query document and according to the rules used for generating the feature vectors corresponding to the stored documents such that the query vector corresponds in its length to the width of the matrix; storing the matrix column-wise; for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more of preferably hardware supported logical operations between the columns of the matrix to obtain one or more additional result columns coding for a similarity measure betweType: GrantFiled: August 14, 2008Date of Patent: March 15, 2011Assignee: BDGB Enterprise Software S.A.R.L.Inventors: Gannady Lapir, Harry Urbshat
-
Patent number: 7433997Abstract: A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said method comprising: coding each document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document; arranging the feature vectors in a matrix; generating a query feature vector based on the query document and according to the rules used for generating the feature vectors corresponding to the stored document s such that the query vector corresponds in its length to the width of the matrix; storing the matrix column-wise; for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more of preferably hardware supported logical operations between the columns of the matrix to obtain one or more additional result columns coding for a similarity measure betwType: GrantFiled: October 3, 2005Date of Patent: October 7, 2008Assignee: BDGB Enterprise Software S.A.R.L.Inventors: Gannady Lapir, Harry Urbshat
-
Publication number: 20060212431Abstract: A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said method comprising: coding each document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document; arranging the feature vectors in a matrix; generating a query feature vector based on the query document and according to the rules used for generating the feature vectors corresponding to the stored document s such that the query vector corresponds in its length to the width of the matrix; storing the matrix column-wise; for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more of preferably hardware supported logical operations between the columns of the matrix to obtain one or more additional result columns coding for a similarity measure betwType: ApplicationFiled: October 3, 2005Publication date: September 21, 2006Inventors: Gannady Lapir, Harry Urbschat
-
Patent number: 6983345Abstract: A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said method comprising: coding each document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document; arranging the feature vectors in a matrix; generating a query feature vector based on the query document and according to the rules used for generating the feature vectors corresponding to the stored documents such that the query vector corresponds in its length to the width of the matrix; storing the matrix column-wise; for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more of preferably hardware supported logical operations between the columns of the matrix to obtain one or more additional result columns coding for a similarity measure betweType: GrantFiled: August 20, 2001Date of Patent: January 3, 2006Assignee: SER Solutions, Inc.Inventors: Gannady Lapir, Harry Urbschat
-
Publication number: 20040054666Abstract: A computer-implemented method of realizing an associative memory capable of storing a set of documents and retrieving one or more stored documents similar to an inputted query document, said method comprising: coding each document or a part of it through a corresponding feature vector consisting of a series of bits which respectively code for the presence or absence of certain features in said document; arranging the feature vectors in a matrix; generating a query feature vector based on the query document and according to the rules used for generating the feature vectors corresponding to the stored documents such that the query vector corresponds in its length to the width of the matrix; storing the matrix column-wise: for those columns of the matrix where the query vector indicates the presence of a feature, bitwise performing one or more of preferably hardware supported logical operations between the columns of the matrix to obtain one or more additional result columns coding for a similarity measure betweType: ApplicationFiled: October 7, 2003Publication date: March 18, 2004Inventors: Gannady Lapir, Harry Urbschat