Patents by Inventor Simon Berkovich

Simon Berkovich 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: 10521441
    Abstract: The invention provides efficient searching with fuzzy criteria in very large information systems. The technique of the present invention uses the Pigeonhole Principle approach. This approach can be utilized with different embodiments, but the most effective realization would be to amplify some already given intrinsic approximate matching capabilities, like those in the FuzzyFind method [1][2]. Considering the following problem, data to be searched is presented as a bit-attribute vector. The searching operation includes finding a subset of this bit-attribute vector that is within particular Hamming distance. Normally, this search with approximate matching criteria requires sequential lookup for the whole collection of the attribute vector. This process can be easily parallelized, but in very large information systems this still would be slow and energy consuming.
    Type: Grant
    Filed: January 2, 2015
    Date of Patent: December 31, 2019
    Assignee: The George Washington University
    Inventors: Maryam Yammahi, Simon Berkovich, Chen Shen
  • Publication number: 20150186471
    Abstract: The invention provides efficient searching with fuzzy criteria in very large information systems. The technique of the present invention uses the Pigeonhole Principle approach. This approach can be utilized with different embodiments. but the most effective realization would be to amplify some already given intrinsic approximate matching capabilities, like those in the FuzzyFind method [1][2]. Considering the following problem, data to be searched is presented as a bit-attribute vector. The searching operation includes finding a subset of this bit-attribute vector that is within particular Flamming distance. Normally, this search with approximate matching criteria requires sequential lookup for the whole collection of the attribute vector. This process can be easily parallelized, but in very large information systems this still would be slow and energy consuming.
    Type: Application
    Filed: January 2, 2015
    Publication date: July 2, 2015
    Applicant: The George Washington University
    Inventors: Maryam Yammahi, Simon Berkovich, Chen Shen
  • Publication number: 20080267200
    Abstract: A router architecture based on combinatorial design. The router includes a plurality of input channels; a plurality of processors; a plurality of output channels; and buses interconnecting the input channels, processors, and output channels in a manner such that each pair of channels exists in only a pre-selected number of processor (pairwise balance property) and subsets of output channels, connected to processing elements. covers entire set of output channels (full covering property).
    Type: Application
    Filed: February 14, 2006
    Publication date: October 30, 2008
    Inventors: Simon Berkovich, Alexander Kuznetsov