Abstract: A system provides images or questions to multiple game participants and receives labels or answers in response thereto. The system uses the labels or answers for various data gathering purposes.

Abstract: A system and a method that manages a user query by a single interaction between a server and a client. A plurality of clients send queries for search results to a server. The server receives these queries and performs multiple searches to generate multiple sets of search results. These sets of search results are ranked, consolidated and passed to the requesting client. The client stores these multiple sets of search results. The client then displays these search results in accordance to the boundary defined by the user. This boundary defines the portions of the search results that the user desires to view. The user may re-define the boundary. The client identifies the search results corresponding to the boundary and displays them.

Abstract: A system provides images or questions to multiple game participants and receives labels or answers in response thereto. The system uses the labels or answers for various data gathering purposes.

Abstract: In a method of profiling a website, an information server receives multiple search queries from a website submitted by different users. Different search results responsive to the search queries are provided to the requesting users. The information server monitors activities of the users on the search results and generates a profile for the website using the search queries and the user activities. When the information server receives a same search query from two different websites, it identifies a plurality of information items associated with the search query. The information server uses profiles of the two websites to customize the information items into two different orders and serves the information items to the two websites in the two different orders.

Abstract: A search system monitors the input of a search query by a user. Before the user finishes entering the search query, the search system identifies and sends a portion of the query as a partial query to the search engine. Based on the partial query, the search engine creates a set of predicted queries. This process may take into account prior queries submitted by a community of users, and may take into account a user profile. The predicted queries are be sent back to the user for possible selection. The search system may also cache search results corresponding to one or more of the predicted queries in anticipation of the user selecting one of the predicted queries. The search engine may also return at least a portion of the search results corresponding to one or more of the predicted queries.

Abstract: Personalized advertisements are provided to a user using a search engine to obtain documents relevant to a search query. The advertisements are personalized in response to a search profile that is derived from personalized search results. The search results are personalized based on a user profile of the user providing the query. The user profile describes interests of the user, and can be derived from a variety of sources, including prior search queries, prior search results, expressed interests, demographic, geographic, psychographic, and activity information.

Abstract: A search engine provides personalized rankings of search results. A user interest profile identifies topics of interest to a user. Each topic is associated with one or more sites, and a boost value, which can be used to augment an information retrieval score of any document from the site. Search results from any search are provided to the user, with a variable control of the ranking of the results. The results can be ranked by their unboosted information retrieval score, thus reflecting no personalization, or by their fully or partially boosted information retrieval scores. This allows the user to selectively control how their interests affect the ranking of the documents.

Abstract: A system and a method that manages a user query by a single interaction between a server and a client. A plurality of clients send queries for search results to a server. The server receives these queries and performs multiple searches to generate multiple sets of search results. These sets of search results are ranked, consolidated and passed to the requesting client. The client stores these multiple sets of search results. The client then displays these search results in accordance to the boundary defined by the user. This boundary defines the portions of the search results that the user desires to view. The user may re-define the boundary. The client identifies the search results corresponding to the boundary and displays them.

Abstract: Techniques for assigning ranks to nodes in a large linked database, such as world wide web or any other hypermedia database, partition the nodes so that the link matrix has a predominantly block-diagonal form. Within each block, a local rank is computed for nodes in the block, possibly by different computer in a distributed computing environment. A block rank is then estimated for each block as a whole, and may optionally include block-level weights to implement customized ranking. The local ranks and block ranks are then combined to form a global rank, which may be used to rank the nodes. Alternatively, a global rank vector for the database may be used as an initial vector in an iterative link-based ranking scheme to obtain more accurate global ranks for the nodes. The global rank vector may be divided to provide local rank vectors for use in subsequent applications of the method.