Abstract: Techniques are described for determining personalized category-based product information for a user. The described techniques may in some situations be used by or on behalf of an online retailer to determine a sorted order of at least some products within a product category for the online retailer to display to a customer user on a category-specific Web page of the online retailer, such as based on a browse request by the customer for that category or on another identification of the category by the customer. The determination of particular personalized category-based sorted products for such a customer may in some situations be performed based at least in part on prior activities of the customer, including prior interactions by the customer with the online retailer (e.g., actions by the customer to view and/or purchase particular products, product brands, product sub-categories, product sizes, etc.).

Abstract: A computer implemented system produces an optimization graph in an online advertising system. The system presents at a computer, a supply of advertising inventory and advertising demand contracts, where each advertising inventory is presented as a supply node and each advertising demand contract is presented as a demand node. The system processes the supply of advertising inventory and the advertising demand contracts. For example, the system partitions the supply nodes into supply partitions and determines whether each supply node is eligible for each demand node. In addition, the system determines the number of eligible supply nodes to be drawn from each supply partition for each demand node.

Abstract: A toolbar is provided, which may be downloaded and installed in a user's web browser. The toolbar uploads the user's browsing history to a server. The server determines, based on the browsing history, which sites the user visits frequently. Additionally, the server determines, based on an analysis of web content, which categories of content, and which concepts, the user is interested in based on the concepts and categories that occur frequently in the user's browsing patterns. The server identifies content of interest to the user—where such content may comprise frequently-updated content, such as news or RSS feeds—and provides a custom web page that shows or identifies the selected content.

Abstract: Systems and methods for adjusting online ads delivery pace derive, in a computer system, a current impression delivery for an ads display contract. A plurality of estimation bands are delivered corresponding to over delivery and under delivery for the ads display contract. A relative distance is determined between the current impression delivery and the plurality of estimation bands. An adjustment factor is selected according to the relative distance. The adjustment factor is sent to a database.

Abstract: Disclosed is a system architecture, components and a searching technique for an Unstructured Information Management System (UIMS). The UIMS may be provided as middleware for the effective management and interchange of unstructured information over a wide array of information sources. The architecture generally includes a search engine, data storage, analysis engines containing pipelined document annotators and various adapters. The searching technique makes use of a two-level searching technique. A search query includes a search operator containing of a plurality of search sub-expressions each having an associated weight value. The search engine returns a document or documents having a weight value sum that exceeds a threshold weight value sum. The search operator is implemented as a Boolean predicate that functions as a Weighted AND (WAND).

Abstract: An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory. Implementation of the contract index includes retrieval techniques to support multi-valued predicates as well as confidence threshold functions using a multi-level tree representation of multi-valued predicates.

Abstract: A toolbar is provided, which may be downloaded and installed in a user's web browser. The toolbar uploads the user's browsing history to a server. The server determines, based on the browsing history, which sites the user visits frequently. Additionally, the server determines, based on an analysis of web content, which categories of content, and which concepts, the user is interested in based on the concepts and categories that occur frequently in the user's browsing patterns. The server identifies content of interest to the user—where such content may comprise frequently-updated content, such as news or RSS feeds—and provides a custom web page that shows or identifies the selected content.

Abstract: A toolbar is provided, which may be downloaded and installed in a user's web browser. The toolbar uploads the user's browsing history to a server. The server determines, based on the browsing history, which sites the user visits frequently. Additionally, the server determines, based on an analysis of web content, which categories of content, and which concepts, the user is interested in based on the concepts and categories that occur frequently in the user's browsing patterns. The server identifies content of interest to the user—where such content may comprise frequently-updated content, such as news or RSS feeds—and provides a custom web page that shows or identifies the selected content.

Abstract: An improved system and method for efficiently evaluating complex Boolean expressions is provided. Leaf nodes of Boolean expression trees for objects represented by Boolean expressions of attribute-value pairs may be assigned a positional identifier that indicates the position of a node in the Boolean expression tree. The positional identifiers of each object may be indexed by attribute-value pairs of the leaf nodes of the Boolean expression trees in an inverted index. Given an input set of attribute-value pairs, a list of positional identifiers for leaf nodes of virtual Boolean expression trees may be found in the index matching the attribute-value pairs of the input set. The list of positional identifiers of leaf nodes may be sorted in order by positional identifier for each contract. An expression evaluator may then verify whether a virtual Boolean expression tree for each contract is satisfied by the list of positional identifiers.

Abstract: A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory.

Abstract: A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory.

Abstract: A method for automatic matching of contracts to inventory using a fixed-length complex predicate representation. An item of inventory is described as a Boolean expression, which is converted into a multi-level, alternating AND/OR impression tree representation with leaf nodes representing conjuncts. Processing the conjuncts of the tree through a contract index results in retrieving a set of candidate contracts that match the at least some but not necessarily all impression tree leaf node predicates. Next, an AND/OR contract tree representation is constructed with each contract tree leaf node having a label representing a projection onto a discrete set of ordered symbols. Contracts with projections that cover the entire range of discrete set of ordered symbols are deemed to satisfy the item of inventory.

Abstract: A computer implemented system produces an optimization graph in an online advertising system. The system presents at a computer, a supply of advertising inventory and advertising demand contracts, where each advertising inventory is presented as a supply node and each advertising demand contract is presented as a demand node. The system processes the supply of advertising inventory and the advertising demand contracts. For example, the system partitions the supply nodes into supply partitions and determines whether each supply node is eligible for each demand node. In addition, the system determines the number of eligible supply nodes to be drawn from each supply partition for each demand node.

Abstract: A method, system and computer readable medium selects additional message content to display to a user when the user request base content. In order to optimize the intermediate selection pool of message candidates (from which a final selection is chosen), for each candidate message, a historical aggregate of CTR data is combined with an offline estimate, also obtained from historical data, of RElative Probability of Action (REPA, which combines computed relevancy scores and ranking information) and with bid amount to obtain an estimate for revenue generation. This estimate is combined with dynamic matching between the message and the page/user pair to obtain a final score for each message that is used to create the intermediate selection pool of message for the page displayed. Final message selection uses a feedback loop, using specific CRT in conjunction with the specific page displayed, for the messages in the intermediately selected pool.

Abstract: Embodiments of methods, apparatuses, devices and systems associated with determining search results are disclosed.

Abstract: Disclosed is a system architecture, components and a searching technique for an Unstructured Information Management System (UIMS). The UIMS may be provided as middleware for the effective management and interchange of unstructured information over a wide array of information sources. The architecture generally includes a search engine, data storage, analysis engines containing pipelined document annotators and various adapters. The searching technique makes use of a two-level searching technique. A search query includes a search operator containing of a plurality of search sub-expressions each having an associated weight value. The search engine returns a document or documents having a weight value sum that exceeds a threshold weight value sum. The search operator is implemented as a Boolean predicate that functions as a Weighted AND (WAND).

Abstract: Disclosed is a system architecture, components and a searching technique for an Unstructured Information Management System (UIMS). The UIMS may be provided as middleware for the effective management and interchange of unstructured information over a wide array of information sources. The architecture generally includes a search engine, data storage, analysis engines containing pipelined document annotators and various adapters. The searching technique makes use of a two-level searching technique. A search query includes a search operator containing of a plurality of search sub-expressions each having an associated weight value. The search engine returns a document or documents having a weight value sum that exceeds a threshold weight value sum. The search operator is implemented as a Boolean predicate that functions as a Weighted AND (WAND).

Abstract: A toolbar is provided, which may be downloaded and installed in a user's web browser. The toolbar uploads the user's browsing history to a server. The server determines, based on the browsing history, which sites the user visits frequently. Additionally, the server determines, based on an analysis of web content, which categories of content, and which concepts, the user is interested in based on the concepts and categories that occur frequently in the user's browsing patterns. The server identifies content of interest to the user—where such content may comprise frequently-updated content, such as news or RSS feeds—and provides a custom web page that shows or identifies the selected content.

Abstract: Disclosed is a technique for building an index. A new indexi+1 is built and an anchor text tablei+1 and a duplicates tableti+1 are output using a storesi, a delta store, and previously generated global analysis computationsi, wherein the previously generated global analysis computationsi include an anchor text tablei, a rank tablei, and a duplicates tablei. New global analysis computationsi+1 are generated using the anchor text tablei+1, the duplicates tablei+1, and the previously generated global analysis computationsi.

Abstract: Disclosed is a technique for indexing data. For each token in a set of documents, a sort key is generated that includes a document identifier that indicates whether a section of a document associated with the sort key is an anchor text section or a context section, wherein the anchor text section and the context text section have a same document identifier; it is determined whether a data field associated with the token is a fixed width; when the data field is a fixed width, the token is designated as one for which fixed width sort is to be performed; and, when the data field is a variable length, the token is designated as one for which a variable width sort is to be performed. The fixed width sort and the variable width sort are performed. For each document, the sort keys are used to bring together the anchor text section and the context section of that document.