Patents by Inventor Nick Koudas

Nick Koudas 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: 20090319518
    Abstract: A method for searching text sources including temporally-ordered data objects, such as a blog, is provided including the steps of: (i) providing access to text sources, each text source including temporally-ordered data objects; (ii) obtaining or generating a search query based on terms and time intervals; (iii) obtaining or generating time data associated with the data objects; (iv) identifying data objects based on the search query; and (v) generating popularity curves based on the frequency of data objects corresponding to one or more of the search terms in the one or more time intervals. A system and computer program for text source searching is also provided.
    Type: Application
    Filed: July 10, 2009
    Publication date: December 24, 2009
    Inventors: Nick Koudas, Nilesh Bansal
  • Patent number: 7631074
    Abstract: A system for a data stream management system includes a filter transport aggregate for a high speed input data stream with a plurality of packets each packet comprising attributes. The system includes an evaluation system to evaluate the high speed input data stream and partitions the packets into groups the attributes and a table, wherein the table stores the attributes of each packets using a hash function. A phantom query is used to define partitioned groups of packets using attributes other than those used to group the packets for solving user queries without performing the user queries on the high speed input data stream.
    Type: Grant
    Filed: September 30, 2005
    Date of Patent: December 8, 2009
    Assignee: AT&T Corp.
    Inventors: Divesh Srivastava, Nick Koudas, Rui Zhang
  • Publication number: 20090171944
    Abstract: The similarity between a query set comprising query set tokens and a database set comprising database set tokens is determined by a similarity score. The database sets belong to a data collection set, which contains all database sets from which information may be retrieved. If the similarity score is greater than or equal to a user-defined threshold, the database set has information relevant to the query set. The similarity score is calculated with an inverse document frequency method (IDF) similarity measure independent of term frequency. The document frequency is based at least in part on the number of database sets in the data collection set and the number of database sets which contain at least one query set token. The length of the query set and the length of the database set are normalized.
    Type: Application
    Filed: January 2, 2008
    Publication date: July 2, 2009
    Inventors: Marios Hadjieleftheriou, Amit Chandel, Nick Koudas, Divesh Srivastava