Abstract: This disclosure describes systems and methods for identifying and correcting anomalies in web graphs. A web graph is transformed into a sequence of tokens via a walk algorithm. The sequence is fingerprinted to form a set of shingles. The singles are compared to shingles for other web graphs in order to determine similarity between web graphs. Actions are then carried out to remove anomalous web graphs and modify parameters governing web mapping in order to decrease the likelihood of future anomalous web graphs being built.

Abstract: Methods and systems are provided for search engine output-associated bidding in online advertising. Techniques are provided in which an advertiser may specify, as part of a bid, one or more requirements relating to search engine output. The one or more requirements may need to be met for an advertisement to be served in connection with the bid.

Abstract: The present invention provides a method and system for optimizing search result rankings through use of a game interface. The method and system includes providing a game interface to at least two users, the game interface comprising at least one search query and at least two search result sets. The method and system further includes detecting the selection of one of the two search result sets by the users based on competition criteria and updating ranking data in response to the selection of one of the two search results. The method and system further includes selecting ranking data associated with a given query, determining an optimum ranking based on aggregating the selected ranking data, and storing the optimum ranking.

Abstract: People are enabled to share tagged data via the Internet. In one embodiment, an Internet site receives, via the Internet, from various different users, content items of many different content types. The site also receives a tag for each content item and maps that tag to that content item. When other users supply search query terms, the site selects tags that match the search query terms. The site presents content items that are mapped to the selected tags. Using this technique, users are able to share with each other content items of all different content types using a single Internet site, without needing to store content items of different types on different Internet sites. In order to share a particular content item with other users, the user who wants to share the content item needs only to disclose the particular content item's tag to the other users.

Abstract: A sequential cell is characterized using interdependent setup/hold time pairs to produce associated clock-to-Q delay values, and then identifying setup/hold time pairs that produce a selected clock-to-Q delay value (e.g., 10% of failure). The identified setup/hold time pairs (or a piecewise linear (PWL) approximation thereof) are then stored in a cell library for use in static timing analysis (STA). During STA, the setup and hold skews calculated for each synchronous circuit are compared with a selected setup/hold time pair stored in the cell library (e.g., a pair having a relatively low hold value). If at least one of the setup and hold skews violates the selected setup/hold time pair, then the remaining identified setup/hold time pairs (or the PWL approximation) are utilized to determine if the synchronous circuit is violates established constraints, and if not, to identify the setup and hold times required to remove the violation.

Abstract: Embodiments of methods, apparatuses, or systems relating to digital images of web pages are disclosed.

Abstract: A system that determines the performance of an integrated circuit (IC). During operation, the system receives probability distributions for parameters for the IC. Next, the system generates samples of the IC, wherein generating a given sample involves using the probability distribution to assign values to the parameters for components within the IC. The system then calculates output performance metrics for the samples based on the assigned values of the parameters, and uses the calculated output performance metrics to generate a distribution of output performance metrics for the samples.

Abstract: The subject matter disclosed herein relates to a system and/or method for allocating data among reduce processes.

Abstract: Disclosed are apparatus and methods for facilitating search queries via a computer network. In certain embodiments, each search term that a user inputs for a search query causes a rich set of contextual information having one or more parameters or facets to be presented to the user to further enhance and refine the search query. The context facets can pertain to the search term itself or contextual information that is associated with search results objects that have been previously associated with such search term. Additionally, the user can be queried for a facet to be associated with the search term. The user can then input parameter values or choose selection option (e.g., numbers, strings, links, etc.) for each facet, and search results can then be provided based on such facet parameter values or selection option input.

Abstract: Disclosed are apparatus and methods for collecting information regarding areas or objects of interest of web pages, or other web objects. The areas or objects of interest are referred to herein as “keys”. In certain embodiments, as web pages are viewed by users, users can define one or more keys within the web pages and these defined keys are retained. Other key information may also be associated with such defined keys. The retained key, as well as other associated key information, may then be shared with users of such web page.

Abstract: Disclosed are apparatus and methods for providing a word or phrase index regarding a particular set of search results. In specific embodiments, a word or phrase index for summarizing the words or phrases (or a subset of same) within the particular search results may be determined. This index may be similar to the inverted index used by some search engines so that each of a plurality of words or phrases are associated with a plurality of search results (e.g., web pages and/or their cached copies) that contain such each word or phrase. The index is determined based on the search results, and the index for the search results is then provided along with the search results. The entries of the provided search result index are preferably selectable so that a user can access the search results that contain at least one of the listed word or phrase in the index.

Abstract: Disclosed are apparatus and methods for providing next click information regarding search results. In certain embodiments, as objects (such as web pages, images, videos, audio files) are searched and clicked, click information is retained. Next click information with respect to specific objects can then be determined. This next click information can then be provided to an object search initiator so that such next click information is presented along with search result objects, for example, during a search query.

Abstract: An improved system and method for offering an auction bundle in an online advertising auction is provided. A pricing engine may determine a price of an auction bundle that may include a bid for an input of a search engine such as a keyword, an output of search engine such as a URL appearing in search results, or a combination of an input and an output of a search engine. In an implementation, bids may be received from bidders for auction bundles, click-through rates for web page placements may be obtained for auction bundles, and the bidders with the highest gain for the auction bundles may be determined for a search query. The advertisements of the bidders with the highest gain may be allocated to web page placements for display with query results.

Abstract: This disclosure describes systems and methods for identifying and correcting anomalies in web graphs. A web graph is transformed into a sequence of tokens via a walk algorithm. The sequence is fingerprinted to form a set of shingles. The singles are compared to shingles for other web graphs in order to determine similarity between web graphs. Actions are then carried out to remove anomalous web graphs and modify parameters governing web mapping in order to decrease the likelihood of future anomalous web graphs being built.

Abstract: This disclosure describes systems and methods for identifying and correcting anomalies in web graphs. A web graph is transformed into a set of weighted features. The set of weighted features are then transformed into a signature via a SimHash algorithm. The signature is compared to the signature of one or more other web graphs in order to determine similarity between web graphs. Actions are then carried out to remove anomalous web graphs and modify parameters governing web mapping in order to decrease the likelihood of future anomalous web graphs being built.

Abstract: This disclosure describes systems and methods for identifying and correcting anomalies in web graphs. A web graph is transformed into a set of weighted features. The set of weighted features are then transformed into a signature via a SimHash algorithm. The signature is compared to the signature of one or more other web graphs in order to determine similarity between web graphs. Actions are then carried out to remove anomalous web graphs and modify parameters governing web mapping in order to decrease the likelihood of future anomalous web graphs being built.

Abstract: A method of processing relationships of at least two datasets is provided. For each of the datasets, a map-reduce subsystem is provided such that the data of that dataset is mapped to corresponding intermediate data for that dataset. The intermediate data for that dataset is reduced to a set of reduced intermediate data for that dataset. Data corresponding to the sets of reduced intermediate data are merged, in accordance with a merge condition. In some examples, data being merged may include the output of one or more other mergers. That is, generally, merge functions may be flexibly placed among various map-reduce subsystems and, as such, the basic map-reduce architecture may be advantageously modified to process multiple relational datasets using, for example, clusters of computing devices.

Abstract: A sequential cell is characterized using interdependent setup/hold time pairs to produce associated clock-to-Q delay values, and then identifying setup/hold time pairs that produce a selected clock-to-Q delay value (e.g., 10% of failure). The identified setup/hold time pairs (or a piecewise linear (PWL) approximation thereof) are then stored in a cell library for use in static timing analysis (STA). During STA, the setup and hold skews calculated for each synchronous circuit are compared with a selected setup/hold time pair stored in the cell library (e.g., a pair having a relatively low hold value). If at least one of the setup and hold skews violates the selected setup/hold time pair, then the remaining identified setup/hold time pairs (or the PWL approximation) are utilized to determine if the synchronous circuit is violates established constraints, and if not, to identify the setup and hold times required to remove the violation.

Abstract: A sequential cell is characterized using interdependent setup/hold time pairs to produce associated clock-to-Q delay values, and then identifying setup/hold time pairs that produce a selected clock-to-Q delay value (e.g., 10% of failure). The identified setup/hold time pairs (or a piecewise linear (PWL) approximation thereof) are then stored in a cell library for use in static timing analysis (STA). During STA, the setup and hold skews calculated for each synchronous circuit are compared with a selected setup/hold time pair stored in the cell library (e.g., a pair having a relatively low hold value). If at least one of the setup and hold skews violates the selected setup/hold time pair, then the remaining identified setup/hold time pairs (or the PWL approximation) are utilized to determine if the synchronous circuit is violates established constraints, and if not, to identify the setup and hold times required to remove the violation.

Abstract: A system and method are disclosed for displaying information associated with a search result. The information may be an advertisement that is displayed when an associated search result is displayed as a result of a search query. For example, an advertiser may identify at least one search result to be associated with its advertisement, such that the advertisement is displayed on a search result page when the identified search result is one of the search results on the page.