Patents by Inventor Alexander Libov

Alexander Libov 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: 11645585
    Abstract: In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.
    Type: Grant
    Filed: January 24, 2022
    Date of Patent: May 9, 2023
    Assignee: Verizon Patent and Licensing Inc.
    Inventors: Edward Bortnikov, Alexander Libov, Ohad Shacham
  • Publication number: 20220147878
    Abstract: In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.
    Type: Application
    Filed: January 24, 2022
    Publication date: May 12, 2022
    Inventors: Edward Bortnikov, Alexander Libov, Ohad Shacham
  • Patent number: 11281725
    Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods automatically generate and provide an interactive rich set of personalized query suggestions within a unified framework. The disclosed systems and methods are able to integrate attributes associated with message data and metadata by transforming such attributes into facets that are combined with term suggestions and presented to the user in a unified manner. The instant disclosure provides an interactive search suggestion mechanism that narrows the search as the user interacts with the dynamically generated and provided suggestions.
    Type: Grant
    Filed: September 19, 2019
    Date of Patent: March 22, 2022
    Assignee: YAHOO ASSETS LLC
    Inventors: Liane Lewin-Eytan, David Carmel, Ariel Raviv, Alexander Libov, Yoelle Maarek, Peter Monaco
  • Patent number: 11244245
    Abstract: In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.
    Type: Grant
    Filed: December 16, 2019
    Date of Patent: February 8, 2022
    Assignee: Verizon Patent and Licensing Inc.
    Inventors: Edward Bortnikov, Alexander Libov, Ohad Shacham
  • Patent number: 10652187
    Abstract: Relevant messages, or “hero results”, which are not ranked at the uppermost part of a time-based listing of search results are identified and such hero results can be displayed apart from the time-based listing of search results. A user can be provided with messages in a time-based presentation as well as messages in a relevance-based presentation. The user can be presented with the most relevant messages from a set of message generated from a search query, even where the most relevant messages are not the most recent ones.
    Type: Grant
    Filed: May 10, 2016
    Date of Patent: May 12, 2020
    Assignee: OATH INC.
    Inventors: Liane Lewin-Eytan, David Carmel, Yoelle Maarek, Ariel Raviv, Alexander Libov, Peter Monaco
  • Publication number: 20200118033
    Abstract: In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.
    Type: Application
    Filed: December 16, 2019
    Publication date: April 16, 2020
    Inventors: Edward Bortnikov, Alexander Libov, Ohad Shacham
  • Publication number: 20200012686
    Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods automatically generate and provide an interactive rich set of personalized query suggestions within a unified framework. The disclosed systems and methods are able to integrate attributes associated with message data and metadata by transforming such attributes into facets that are combined with term suggestions and presented to the user in a unified manner. The instant disclosure provides an interactive search suggestion mechanism that narrows the search as the user interacts with the dynamically generated and provided suggestions.
    Type: Application
    Filed: September 19, 2019
    Publication date: January 9, 2020
    Inventors: Liane Lewin-Eytan, David Carmel, Ariel Raviv, Alexander Libov, Yoelle Maarek, Peter Monaco
  • Patent number: 10510017
    Abstract: In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.
    Type: Grant
    Filed: November 18, 2015
    Date of Patent: December 17, 2019
    Assignee: Oath Inc.
    Inventors: Edward Bortnikov, Alexander Libov, Ohad Shacham
  • Patent number: 10459981
    Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods automatically generate and provide an interactive rich set of personalized query suggestions within a unified framework. The disclosed systems and methods are able to integrate attributes associated with message data and metadata by transforming such attributes into facets that are combined with term suggestions and presented to the user in a unified manner. The instant disclosure provides an interactive search suggestion mechanism that narrows the search as the user interacts with the dynamically generated and provided suggestions.
    Type: Grant
    Filed: January 10, 2017
    Date of Patent: October 29, 2019
    Assignee: OATH INC.
    Inventors: Liane Lewin-Eytan, David Carmel, Ariel Raviv, Alexander Libov, Yoelle Maarek, Peter Monaco
  • Publication number: 20180196822
    Abstract: Disclosed are systems and methods for improving interactions with and between computers in content searching, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods automatically generate and provide an interactive rich set of personalized query suggestions within a unified framework. The disclosed systems and methods are able to integrate attributes associated with message data and metadata by transforming such attributes into facets that are combined with term suggestions and presented to the user in a unified manner. The instant disclosure provides an interactive search suggestion mechanism that narrows the search as the user interacts with the dynamically generated and provided suggestions.
    Type: Application
    Filed: January 10, 2017
    Publication date: July 12, 2018
    Inventors: Liane Lewin-Eytan, David Carmel, Ariel Raviv, Alexander Libov, Yoelle Maarek, Peter Monaco
  • Publication number: 20170329779
    Abstract: Relevant messages, or “hero results”, which are not ranked at the uppermost part of a time-based listing of search results are identified and such hero results can be displayed apart from the time-based listing of search results. A user can be provided with messages in a time-based presentation as well as messages in a relevance-based presentation. The user can be presented with the most relevant messages from a set of message generated from a search query, even where the most relevant messages are not the most recent ones.
    Type: Application
    Filed: May 10, 2016
    Publication date: November 16, 2017
    Inventors: Liane Lewin-Eytan, David Carmel, Yoelle Maarek, Ariel Raviv, Alexander Libov, Peter Monaco
  • Publication number: 20170140012
    Abstract: In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.
    Type: Application
    Filed: November 18, 2015
    Publication date: May 18, 2017
    Inventors: Edward Bortnikov, Alexander Libov, Ohad Shacham