Patents by Inventor Franco Maria NARDINI

Franco Maria NARDINI 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).

  • Publication number: 20240370446
    Abstract: A method and system are described for improving the speed and efficiency of obtaining conversational search results. A user may speak a phrase to perform a conversational search or a series of phrases to perform a series of searches. These spoken phrases may be enriched by context and then converted into a query embedding. A similarity between the query embedding and document embeddings is used to determine the search results including a query cutoff number of documents and a cache cutoff number of documents. A second search phrase may use the cache of documents along with comparisons of the returned documents and the first query embedding to determine the quality of the cache for responding to the second search query. If the results are high-quality then the search may proceed much more rapidly by applying the second query only to the cached documents rather than to the server.
    Type: Application
    Filed: July 11, 2024
    Publication date: November 7, 2024
    Inventors: Ophir Frieder, Ida Mele, Christina-Ioana Muntean, Franco Maria Nardini, Raffaele Perego, Nicola Tonellotto
  • Patent number: 12067021
    Abstract: A method and system are described for improving the speed and efficiency of obtaining conversational search results. A user may speak a phrase to perform a conversational search or a series of phrases to perform a series of searches. These spoken phrases may be enriched by context and then converted into a query embedding. A similarity between the query embedding and document embeddings is used to determine the search results including a query cutoff number of documents and a cache cutoff number of documents. A second search phrase may use the cache of documents along with comparisons of the returned documents and the first query embedding to determine the quality of the cache for responding to the second search query. If the results are high-quality then the search may proceed much more rapidly by applying the second query only to the cached documents rather than to the server.
    Type: Grant
    Filed: February 21, 2023
    Date of Patent: August 20, 2024
    Assignee: Georgetown University
    Inventors: Ophir Frieder, Ida Mele, Christina-Ioana Muntean, Franco Maria Nardini, Raffaele Perego, Nicola Tonellotto
  • Publication number: 20230267126
    Abstract: A method and system are described for improving the speed and efficiency of obtaining conversational search results. A user may speak a phrase to perform a conversational search or a series of phrases to perform a series of searches. These spoken phrases may be enriched by context and then converted into a query embedding. A similarity between the query embedding and document embeddings is used to determine the search results including a query cutoff number of documents and a cache cutoff number of documents. A second search phrase may use the cache of documents along with comparisons of the returned documents and the first query embedding to determine the quality of the cache for responding to the second search query. If the results are high-quality then the search may proceed much more rapidly by applying the second query only to the cached documents rather than to the server.
    Type: Application
    Filed: February 21, 2023
    Publication date: August 24, 2023
    Inventors: Ophir Frieder, Ida Mele, Christina-Ioana Muntean, Franco Maria Nardini, Raffaele Perego, Nicola Tonellotto
  • Patent number: 11106685
    Abstract: The present invention concerns a novel method to efficiently score documents (texts, images, audios, videos, and any other information file) by using a machine-learned ranking function modeled by an additive ensemble of regression trees. A main contribution is a new representation of the tree ensemble based on bitvectors, where the tree traversal, aimed to detect the leaves that contribute to the final scoring of a document, is performed through efficient logical bitwise operations. In addition, the traversal is not performed one tree after another, as one would expect, but it is interleaved, feature by feature, over the whole tree ensemble. Tests conducted on publicly available LtR datasets confirm unprecedented speedups (up to 6.5×) over the best state-of-the-art methods.
    Type: Grant
    Filed: June 17, 2015
    Date of Patent: August 31, 2021
    Assignee: Istella S.p.A.
    Inventors: Domenico Dato, Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele Perego, Nicola Tonellotto, Rossano Venturini
  • Publication number: 20180217991
    Abstract: The present invention concerns a novel method to efficiently score documents (texts, images, audios, videos, and any other information file) by using a machine-learned ranking function modeled by an additive ensemble of regression trees. A main contribution is a new representation of the tree ensemble based on bitvectors, where the tree traversal, aimed to detect the leaves that contribute to the final scoring of a document, is performed through efficient logical bitwise operations. In addition, the traversal is not performed one tree after another, as one would expect, but it is interleaved, feature by feature, over the whole tree ensemble. Tests conducted on publicly available LtR datasets confirm unprecedented speedups (up to 6.5×) over the best state-of-the-art methods.
    Type: Application
    Filed: June 17, 2015
    Publication date: August 2, 2018
    Applicant: Istella S.p.A.
    Inventors: Domenico DATO, Claudio LUCCHESE, Franco Maria NARDINI, Salvatore ORLANDO, Raffaele PEREGO, Nicola TONELLOTTO, Rossano VENTURINI