Patent application number | Description | Published |
20090006974 | AUTOMATIC SELECTION OF USER-ORIENTED WEB CONTENT - 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. | 01-01-2009 |
20100082608 | SYSTEM, METHOD, OR APPARATUS RELATING TO DETERMINING SEARCH RESULTS BASED AT LEAST IN PART ON ONE OR MORE CONTEXT FEATURES - Embodiments of methods, apparatuses, devices and systems associated with determining search results are disclosed. | 04-01-2010 |
20110066496 | Combining Historical CTR and Bid Amount in Search Message Selection - 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. | 03-17-2011 |
20110187717 | Producing Optimization Graphs in Online Advertising Systems - 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. | 08-04-2011 |
20110213659 | System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates and Confidence Threshold Values - 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. 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. | 09-01-2011 |
20110213660 | System and Method for Automatic Matching of Contracts in an Inverted Index to Impression Opportunities Using Complex Predicates with Multi-Valued Attributes - 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. 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. | 09-01-2011 |
20110213767 | System and Method for Automatic Matching of Contracts Using a Fixed-Length Predicate Representation - 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. 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. | 09-01-2011 |
20110225038 | System and Method for Efficiently Evaluating Complex Boolean Expressions - 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. | 09-15-2011 |
20120117482 | AUTOMATIC SELECTION OF USER-ORIENTED WEB CONTENT - 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. | 05-10-2012 |