Patents Assigned to Overture Services, Inc.
-
Patent number: 6947930Abstract: A received query is processed so as to generate an initial group of ranked documents corresponding to the received query. Each document in all or a portion of the documents in the initial group of ranked documents is associated with a respective set of ranked candidate terms such that each candidate term in the respective set of ranked candidate terms is embedded within the document. Each respective set of ranked candidate terms is identified at a time prior to the processing of the received query. In accordance with a selection function, a subset of the candidate terms in one or more of the respective sets of candidate terms is selected. In response to the received query, the initial group of ranked documents and the subset of candidate terms are presented.Type: GrantFiled: April 25, 2003Date of Patent: September 20, 2005Assignee: Overture Services, Inc.Inventors: Peter G. Anick, Alastair Gourlay, John Thrall
-
Patent number: 6907566Abstract: A method and system for placement of graphical objects on a page to optimize the occurrence of an event associated with such objects. The graphical objects might include, for instance, advertisements on a webpage, and the event would include a user clicking on that ad. The page includes positions for receipt of the object material. Data regarding the past performance of the objects is stored and updated as new data is received. A user requests a page from a server associated with system. The server uses the performance data to derive a prioritized arrangement of the objects on the page. The server performs a calculation regarding the likelihood that an event will occur for a given object, as displayed to a particular user. The objects are arranged according to this calculation and returned to the user on the requested page. The likelihood can also be multiplied by a weighting factor and the objects arranged according to this product.Type: GrantFiled: April 2, 1999Date of Patent: June 14, 2005Assignee: Overture Services, Inc.Inventors: Charles McElfresh, Paul Mineiro, Michael Radford
-
Patent number: 6876997Abstract: A method of generating a search result list also provides related searches for use by a searcher. Search listings which generate a match with a search request submitted by the searcher are identified in a pay for placement database which includes a plurality of search listings. Related search listings contained in a related search database generated from the pay for placement database are identified as relevant to the search request. A search result list is returned to the searcher including the identified search listings and one or more of the identified search listings.Type: GrantFiled: May 22, 2000Date of Patent: April 5, 2005Assignee: Overture Services, Inc.Inventors: Phillip G. Rorex, Thomas A. Soulanille, Bradley R. Haugaard
-
Patent number: 6871202Abstract: A method and apparatus for ranking a plurality of pages identified during a search of a linked database includes forming a linear combination of two or more matrices, and using the coefficients of the eigenvector of the resulting matrix to rank the quality of the pages. The matrices includes information about the pages and are generally normalized, stochastic matrices. The linear combination can include attractor matrices that indicate desirable or “high quality” sites, and/or non-attractor matrices that indicate sites that are undesirable. Attractor matrices and non-attractor matrices can be used alone or in combination with each other in the linear combination. Additional bias toward high quality sites, or away from undesirable sites, can be further introduced with probability weighting matrices for attractor and non-attractor matrices. Other known matrices, such as a co-citation matrix or a bibliographic coupling matrix, can also be used in the present invention.Type: GrantFiled: May 6, 2003Date of Patent: March 22, 2005Assignee: Overture Services, Inc.Inventor: Andrei Z. Broder
-
Publication number: 20040260689Abstract: A system for advertisers to efficiently manage their search listings in placement database search system includes grouping means for managing multiple categories for the search listings and query means for searching search listings. The system further includes quick-fill means for modifying an attribute in plurality of search listings by specifying the modification at single location.Type: ApplicationFiled: June 8, 2004Publication date: December 23, 2004Applicant: Overture Services, Inc.Inventors: Ann-Bettina Colace, Scott W. Snell, Jeremy Daw, Dominic Dough-Ming Cheung, Benjamin James Watkins, Thomas A. Soulanille, Matthew S. Ropp, Gabriel Graham, Peng Zhao, Kenneth A. Kharma, Susan Florence Phillips
-
Publication number: 20040243569Abstract: A computer implemented method performs constrained searching of an index of a database. The information of the database is stored as a plurality of records. A unique location is assigned to each indexable portion of information of the database. Index entries are written to a memory where each index entry includes a word entry representing a unique indexable portion of information, and one or more location entries for each occurrence of the unique indexable portion information. The index entries are sorted according to a collating order of the word entries, and sequentially according to the location entries of each index entry. A query is parsed to generate a first term and a second term related by an AND logical operator, the AND operator requires that a first index entry corresponding to the first term and a second index entry corresponding to the second term both have locations in the same record to satisfy a query.Type: ApplicationFiled: April 20, 2004Publication date: December 2, 2004Applicant: Overture Services, Inc.Inventor: Michael Burrows
-
Patent number: 6826572Abstract: A system for advertisers to efficiently manage their search listings in placement database search system includes grouping means for managing multiple categories for the search listings and query means for searching search listings. The system further includes quick-fill means for modifying an attribute in plurality of search listings by specifying the modification at single location.Type: GrantFiled: November 13, 2001Date of Patent: November 30, 2004Assignee: Overture Services, Inc.Inventors: Ann-Bettina Colace, Scott W. Snell, Jeremy Daw, Dominic Dough-Ming Cheung, Benjamin James Watkins, Thomas A. Soulanille, Matthew S. Ropp, Gabriel Graham, Peng Zhao, Kenneth A. Kharma, Susan Florence Phillips
-
Publication number: 20040230574Abstract: A method and system for providing a set of search terms in response to a user input are disclosed. A first set of search terms is selected from a master set of search terms based upon a match between the input and the search terms or based upon a predefined association between the input and the search terms. A second set of search terms is selected from the first set of search terms in response to a value score that is established for each of the search terms. The value score is selected based at least in part upon the amount of revenue that each search term generates for the system's operator.Type: ApplicationFiled: March 5, 2004Publication date: November 18, 2004Applicant: Overture Services, IncInventor: Alexander N. Kravets
-
Patent number: 6799298Abstract: According to the present invention, a technique for locating an item of interest within a stored representation of data is disclosed. The item of interest is preferably located within a particular one of a plurality of stored representations of data in a network having a plurality of network stations. In one embodiment, the technique is realized by first searching a plurality of stored annotations corresponding to different items within a plurality of stored representations of data to locate an annotation of interest corresponding to the item of interest, wherein the annotation of interest has an associated search identifier. A search request is then transmitted, from a first of the plurality of network stations to a second of the plurality of network stations, for the search identifier and an associated address identifier corresponding to a location of the particular one of the plurality of stored representations of data within the plurality of stored representations of data.Type: GrantFiled: March 22, 2001Date of Patent: September 28, 2004Assignee: Overture Services, Inc.Inventors: Arjen P. deVries, Michael Sokolov, David E. Kovalcin, Brian Eberman, Leonidas Kontothanassis
-
Patent number: 6778975Abstract: A search engine receives query terms from a client. In response, the search engine executes a search on a web directory to identify zero or more documents that match the query terms. The identified documents are associated with one or more categories. The search engine probabilistically selects one of the categories associated with the identified documents. Each message in a message database is also associated with one or more of the categories. The search engine accesses the message database and selects at least one message associated with the selected category. The search engine returns a web page containing references to the documents matching the query terms and the one or more messages selected from the message database to the client.Type: GrantFiled: March 5, 2001Date of Patent: August 17, 2004Assignee: Overture Services, Inc.Inventors: Peter Anick, Farzin Maghoul, Johannes L. Marais, Laurent Chavet
-
Patent number: 6775831Abstract: A computer program and task request interface which enables large volumes of data to be processed efficiently and rapidly by multiple computers on a network. The data that requires processing can be in any format. The task request interface allows any arbitrary task to be performed on the input data. The number of computers which may participate in any given data processing task is essentially unlimited. The number of programs that can participate in the system is also essentially unlimited if the program uses run time evaluable code. Any computer operating system that runs a specified computer language interpreter can participate in the distributed processing of the input data.Type: GrantFiled: February 11, 2000Date of Patent: August 10, 2004Assignee: Overture Services, Inc.Inventors: John Joseph Carrasco, Stephan Doliov, Frank B. Ehrenfried
-
Publication number: 20040103024Abstract: A data processing system enables a network of interconnected public access computers (250) to act as a continuous transactional exchange for electronic advertising. The system customizes paid advertising, enabling dynamic pricing and price discovery. The system provides extensive real-time tracking which supports a hybrid pay for performance model as well as a process for multi-stage optimization.Type: ApplicationFiled: November 22, 2002Publication date: May 27, 2004Applicants: Matchcraft, Inc., Overture Services, Inc.Inventors: Dorab Patel, Scott D. Kalter, Uzi Eliahu
-
Publication number: 20040073538Abstract: An information retrieval system and method employing spatially selective features. A geo-coded database stores advertiser records which include location information. Received search requests are matched with database records based on location information in the search requests and the record location information. In this manner, a user can search for information on a local basis and receive only the most relevant local search results.Type: ApplicationFiled: October 9, 2002Publication date: April 15, 2004Applicants: Lasoo, Inc., Overture Services, Inc.Inventors: Peter Leishman, Peter Forth, John Stewart
-
Patent number: 6704727Abstract: A method and system for providing a set of search terms in response to a user input are disclosed. A first set of search terms is selected from a master set of search terms based upon a match between the input and the search terms or based upon a predefined association between the input and the search terms. A second set of search terms is selected from the first set of search terms in response to a value score that is established for each of the search terms. The value score is selected based at least in part upon the amount of revenue that each search term generates for the system's operator.Type: GrantFiled: January 31, 2000Date of Patent: March 9, 2004Assignee: Overture Services, Inc.Inventor: Alexander N. Kravets
-
Patent number: 6701317Abstract: A process for constructing a server for collecting, arranging and storing data that defines the connectivity of pages on the World Wide Web (Web). The process input is a set of compressed ASCII links files, wherein each links file is a series of source URLs and corresponding destination URLs. A temporary URLs_info Table is created and initialized. The links files and URLs metadata are read. Buffers of unique URLs are sorted and written from the links files into URL runs. An ID Index is created from the URL_info table. CS_ids are assigned to URLs and written to the ID Index. Both a compressed URL data structure and a URL Index are created. A Host Table is created. URL fingerprints are converted to CS_ids, and preliminary outstarts to CS_ids and preliminary outstarts and outlinks tables are created. Compressed outstarts and outlinks tables are created from the preliminary tables. Subsequently, compressed instarts and inlinks tables are created based on the outstarts and outlinks tables.Type: GrantFiled: September 19, 2000Date of Patent: March 2, 2004Assignee: Overture Services, Inc.Inventors: Janet Lynn Wiener, Michael Burrows
-
Patent number: 6665837Abstract: A method is described for identifying related pages among a plurality of pages in a linked database such as the World Wide Web. An initial page is selected from the plurality of pages. Pages linked to the initial page are represented as a graph in a memory. The pages represented in the graph are scored on content, and a set of pages is selected, the selected set of pages having scores greater than a first predetermined threshold. The selected set of pages is scored on connectivity, and a subset of the set of pages that have scores greater than a second predetermined threshold are selected as related pages.Type: GrantFiled: August 10, 1998Date of Patent: December 16, 2003Assignee: Overture Services, Inc.Inventors: Jeffrey Dean, Monika R. Henzinger, Andrei Z. Broder
-
Publication number: 20030149938Abstract: A method and system for placement of graphical objects on a page to optimize the occurrence of an event associated with such objects. The graphical objects might include, for instance, advertisements on a webpage, and the event would include a user clicking on that ad. The page includes positions for receipt of the object material. Data regarding the past performance of the objects is stored and updated as new data is received. A user requests a page from a server associated with system. The server uses the performance data to derive a prioritized arrangement of the objects on the page. The server performs a calculation regarding the likelihood that an event will occur for a given object, as displayed to a particular user. The objects are arranged according to this calculation and returned to the user on the requested page. The likelihood can also be multiplied by a weighting factor and the objects arranged according to this product.Type: ApplicationFiled: February 14, 2003Publication date: August 7, 2003Applicant: Overture Services, Inc.Inventors: Charles McElfresh, Paul Mineiro, Michael Radford
-
Publication number: 20030149937Abstract: A method and system for placement of graphical objects on a page to optimize the occurrence of an event associated with such objects. The graphical objects might include, for instance, advertisements on a webpage, and the event would include a user clicking on that ad. The page includes positions for receipt of the object material. Data regarding the past performance of the objects is stored and updated as new data is received. A user requests a page from a server associated with system. The server uses the performance data to derive a prioritized arrangement of the objects on the page. The server performs a calculation regarding the likelihood that an event will occur for a given object, as displayed to a particular user. The objects are arranged according to this calculation and returned to the user on the requested page. The likelihood can also be multiplied by a weighting factor and the objects arranged according to this product.Type: ApplicationFiled: February 14, 2003Publication date: August 7, 2003Applicant: Overture Services, Inc.Inventors: Charles McElfresh, Paul Mineiro, Michael Radford