Yahoo! Inc.

Google Inc.

Randolph Preston McAfee

Shanmugasundaram Ravikumar

Patrick Hummel

Andrew Stephen Tomkins

Christopher Kenneth Harris

John C Langford

Kishore A Papineni

Darshan Vishwanath Kantak

Timothy S Lipus

Chi-Chao Chang

Sai-Ming (Eliot) Li

Joshua V Dillon

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for distributing content items are disclosed. In one aspect, a method includes accessing a scaling factor value and accessing a first page value range specifying at least a high page value and a low page value. A determination is made that a first ranking of content items based on the high page value does not match a second ranking of the content items that is based on the low page value. In response to determining that the first ranking does not match the second ranking, an updated first ranking and an updated second ranking are determined based on a second page value range. A determination is made that the updated first ranking matches the updated second ranking. Content items are distributed based on the updated first ranking.

Performance based content item ranking

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for ranking content items. In one aspect, a method includes identifying, for a content item, a bid value specifying an amount a content item provider is willing to pay for user interaction with the content item. A predicted performance measure is identified for the content item. The predicted performance measure is adjusted based on a weighting factor for the content item. The weighting factor for the content item is indicative of confidence that the predicted performance measure will match an actual performance measure for the content item and can be different than a weighting factor for another content item identified for inclusion in a ranking with the content item. A rank score is determined for the content item using the bid value and adjusted predicted performance measure. The content item is provided based on the rank score.

Ranking content items using predicted performance

A method and system for organizing digital photographs is disclosed. A plurality of digital photographs are obtained. Each digital photograph in the plurality is analyzed to obtain metadata related to the digital photograph and/or photograph content information related to the digital photograph. The metadata and/or the photograph content information is then analyzed. The plurality of digital photographs are automatically organized into clusters. Each cluster is associated with one or more predetermined cluster parameter. Each cluster parameter is associated with a metadata item. The digital photographs are then displayed (e.g., in a web page) on a computing device in accordance with the cluster parameter(s). One or more of the digital photographs are reorganized into a different cluster each time additional metadata related to the one or more digital photographs is received.

Method and apparatus for organizing digital photographs

Embodiments are directed towards employing an admission controller (AC) network device to coordinate voluntary requests by traffic source devices (TSDs) to transmit traffic over a network. The TSDs submit voluntary requests to transmit network traffic during an allocated time frame to the AC. The AC monitors historical network traffic data and, based on various allocation policies, provides permission to at least some of the TSDs in the form of a nonexclusive lease of bandwidth with a rate cap for an allocated time frame. The TSDs receiving the lease voluntarily agree to transmit traffic not exceeding the rate cap for the time frame of the lease. TSDs that receive a zero rate cap voluntarily agree not to transmit. However, urgent network traffic bypasses the AC. The allocation policies used to determine the rate cap and number of permitted senders include a reactive approach, a predictive approach, and a predictive-reactive approach.

Voluntary admission control for traffic yield management

A method of providing advertising services selects a finite set of topics, and arranges the selected set of topics into a hierarchical structure. The method classifies impression items into the nodes within the hierarchical structure, and allows bidding against the nodes within the hierarchical structure. Some embodiments allow a bidder to request a refinement of the hierarchical structure. These embodiments receive such a request, and compare the request to a set of criteria. If the request meets the set of criteria, the method divides a first node in the hierarchical structure to at least a second and third node. The method allows bidders to bid on each of the first, second, and third nodes. The method optionally measures a performance for the nodes within the hierarchical structure. Based on the measure of performance for the nodes, the method preferably removes an under-performing node from the hierarchical structure.

Auction-pricing many substitute products

Community-based rating information is generated about a Web site, Web page or other network-accessible content for use in Web filtering operations. The rating information may relate to the appropriateness of the content for a particular audience or audiences, such as for children or for children of different age groups. The rating information is based on feedback provided by users who have accessed the content in question. Where the group of users providing feedback is sufficiently large, the rating assigned to the content will tend to accurately reflect community standards. Also, because the rating information is based on user feedback, the rating information can change over time to reflect changing community attitudes towards content.

Growing community of inventors

San Marino, CA, United States of America

Randolph Preston McAfee