Yahoo! Inc.

Wal-mart Stores, Inc.

Kosmix Corporation

Jason Zien

Erik Nathan Vee

Venkatesh Harinarayan

Marcus Felipe Fontoura

Jayavel Shanmugasundaram

Sergei Vassilvitskii

Suhas Sadanandan

Sumanth Jagannath

Javavel Shanmugasundaram

Srihari Venkatesan

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.

Producing optimization graphs in online advertising systems

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&#x2014;where such content may comprise frequently-updated content, such as news or RSS feeds&#x2014;and provides a custom web page that shows or identifies the selected content.

Automatic selection of user-oriented web content

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.

System and method for automatic matching of contracts using a fixed-length predicate representation

Growing community of inventors

Mountain View, CA, United States of America

Jason Zien