Abstract: A system, method and computer program product is described that matches commercial incentives to consumers based on targeting data associated with the commercial incentive and user data associated with consumers in a manner that advantageously allows for highly-targeted delivery of commercial incentives to the consumers that are most likely to use them. Because both the targeting data and the user data may include spatial, temporal, social and topical data, matching may be performed based on any or all of these data types, as well as based on any combination of these data types.

Abstract: A mobile device, system, and method are directed towards enabling a user, virtually on the fly, to invite another user to participate in an on-line conferencing session, by providing a link that automatically enables the other user to participate in the conferencing session. In one embodiment, the conferencing session is a text messaging conference session, such as one that might employ instant messaging, or the like. In one embodiment, a user may request a conferencing session to be established, by sending a request to a server device. The request may, include an identifier of an invitee with whom the first user wishes to communicate. The server determines a unique link for the invitee and session, and sends the invitee an invite message with their unique link. Selecting the unique link enables the invitee to automatically access and to participate in the conferencing session with the first user.

Abstract: A device, system, and method are directed towards managing and tracking of cross-domain user activities through use of a beacon. As a user of a client device requests content from different domain services managed by a common entity, they may receive a Uniform Resource Locator (URL) to a beacon in at least one of the different domains. In one embodiment, the beacon is a single pixel image. The client device may also receive a Match-ID. A beacon server in one of the other domains may receive the request for the beacon, and store in a domain log the Match-ID, and other information about the client device, which domain service provided the URL, and/or other related user activities. The different domain logs may then be employed for use in searching for matching Match-IDs, joining common user or client device activities, and for tracking other cross-domain user activities.

Abstract: Methods, systems and computer readable mediums are provided for drafting one or more players in a fantasy sport. In one method, a list of available players available for drafting to a user's fantasy team is retrieved from a data store. Each available player has an associated ranking. A first candidate player and a second candidate player are identified from the available players based, at least in part, upon a first and a second drafting criterion, respectively. A weighted ranking is computed for at least one of the first and the second candidate player using at least one weighting factor corresponding to the first and the second drafting criterion. One of the first and the second candidate player is selected as a drafted player based upon the weighted ranking.

Abstract: In one embodiment, a tree traversal sequentially processes every level of two or more binary trees until reaching a leaf node for each the binary trees. Processing each level of the binary trees comprises: determining whether each traversed node of the remaining binary trees at the level is a non-leaf node or a leaf node; for the traversed leaf nodes at the level, remove the binary trees to which the leaf nodes belong from the remaining binary trees; and iteratively evaluating the traversed non-leaf nodes at the level of every n remaining binary trees until the non-leaf nodes at the level of all of the remaining binary trees are evaluated, where n?2 and evaluating the non-leaf nodes of each n binary trees comprises concurrently evaluating the n non-leaf nodes of the n binary trees to determine to which one of the two child nodes of each of the n non-leaf nodes to traverse.

Abstract: Multiple sets of data are obtained from different sources. Each data set is represented using a different format having a different syntax and organized in a multi-level nested data structure. Each data set is reformatted into a standardized table format using a depth-first recursive algorithm without relying on the syntax schema of the original format of the data set. Various operations are performed on the tables corresponding to the data sets, including but not limited to joining multiple tables, grouping selected rows of a table, ranking rows of a table, adding or deleting fields from selected rows of a table, etc. Optionally, inferred namespace and text normalization are utilized for selected table operations. One or more templates are provided for converting the data set of a table to a format that may be presented to a user.

Abstract: Multiple sets of data are obtained from different sources. Each data set is represented using a different format having a different syntax and organized in a multi-level nested data structure. Each data set is reformatted into a standardized table format using a depth-first recursive algorithm without relying on the syntax schema of the original format of the data set. Various operations are performed on the tables corresponding to the data sets, including but not limited to joining multiple tables, grouping selected rows of a table, ranking rows of a table, adding or deleting fields from selected rows of a table, etc. Optionally, inferred namespace and text normalization are utilized for selected table operations. One or more templates are provided for converting the data set of a table to a format that may be presented to a user.

Abstract: A device, system, and method are directed towards enabling a user to disambiguate an identity of a member included in a user's social network (USN), and towards enabling an operation to be performed based on information about the member. The USN is determined. The NID of the member is received. If the NID is non-unique within the USN, member distinctions are determined for members in the USN who are associated with the same NID. The member distinctions are sent to the user. The user makes a selection of one of the members associated with one of the member distinctions. Based on the selection, information about the selected member is received. The operation is enabled to be performed based on the information about the selected member. The operation may include addressing the selected member, enabling a communication between the user and the selected member, or the like.

Abstract: The present application is directed to systems and methods for associating a geographic location with an IP address. Generally, an IP address associated with each of a plurality of browser cookies is determined, where each of the plurality of browser cookies indicate a geographic location such as a home address or business address of a user. A geo tag is associated with each of the plurality of browser cookies and a subset of the plurality of browser cookies including browser cookies associated with a first IP address is identified. The subset of the plurality of browser cookies is clustered into a spatial cluster including browser cookies associated with geo tags located within a defined distance of a geo tag of at least one other browser cookie of the cluster. A geographic location associated with a geographic center of the cluster is then associated with the first IP address.

Abstract: The disclosure describes systems and methods for disambiguating a non-unique identifiers of real world entities (RWEs) detected by a computing network by dynamically identifying relationships between RWEs known to the network. The relationships are determined based on social, spatial, temporal and logical information known about the RWEs based on the RWEs previous interactions with the network. These relationships are then used to generate a probability for each RWE that the non-unique identifier identifies that RWE. Based on the probabilities an RWE is selected and the proper network identifier may be used in place of the non-unique identifier.

Abstract: Methods, systems and computer readable mediums are provided for indexing network resources. One method includes accessing, using one or more computer systems, a data store of menu items. The method further includes accessing identification information associated with one or more food providers from one or more data sources. One or more network resources are crawled based on the identification information to search for one or more menu items in the data store of menu items associated with corresponding ones of the food providers. Using the one or more computing systems, an index feed is generated, the index feed comprising the identification information of one or more of the food providers, and one or more menu items associated with the identification information of corresponding food providers based on the crawl and search.

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: Techniques are described for directing connections between clients and the closest web server. Authoritative DNS resolvers of a network are placed at edges of the network. Using anycast, the authoritative DNS resolvers advertise routes of their destination netblock to the Internet. A request from a client to connect to the network is routed, based upon BGP tables, to the closest particular authoritative DNS resolver. Once the request is received, a response is sent to the client with the IP address of the closest web server. The closest web server is determined through in-network health check measurements, with the authoritative DNS resolvers dynamically selecting IP addresses closest to themselves. Routing protocols that directed the packet to the closest authoritative DNS resolver also dictate the route of subsequent traffic to the network. Thus, the closest web server selected by the authoritative DNS resolver is also the closest web server to the client.

Abstract: A system for selecting electronic advertisements from an advertisement pool to match the surrounding content is disclosed. To select advertisements, the system takes an approach to content match that focuses on capturing subtler linguistic associations between the surrounding content and the content of the advertisement. The system of the present invention implements this goal by means of simple and efficient semantic association measures dealing with lexical collocations such as conventional multi-word expressions like “big brother” or “strong tea”. The semantic association measures are used as features for training a machine learning model. In one embodiment, a ranking SVM (Support Vector Machines) trained to identify advertisements relevant to a particular context. The trained machine learning model can then be used to rank advertisements for a particular context by supplying the machine learning model with the semantic association measures for the advertisements and the surrounding context.

Abstract: Disclosed are methods and apparatus for performing named entity recognition. A set of candidates and corresponding contexts are obtained, each of the set of candidates being a potential seed example of an entity. The contexts of at least a portion of the set of candidates are compared with contexts of a set of seed examples of the entity such that a subset of the set of candidates are added to the set of the seed examples. A set of rules are created from the set of seed examples obtained in the comparing step. A final set of seed examples of the entity is generated by executing the set of rules against the set of candidates.

Abstract: Systems and methods are provided for determining items or people of potential interest to recommend to users in a computer-based network. Implied social networks may be determined based at least in part on obtained social behavior information. Items or people of potential interest to users may be determined based at least in part on implied social network information. Vocabulary taxonomies may be associated with, or used in determining, implied social networks.

Abstract: Embodiments are directed towards an automated machine learning framework to extract keywords within a message that are relevant to an attachment to the message. The machine learning model finds a set of relevant sentences within the message determined to be relevant to the one or more attachments based on identification of one or more sentence level features within a given sentence. The sentence level features include, for example, anchor features, noisy sentence features, short message features, threading features, anaphora detections, and lexicon features. From the set of relevant sentences, useful keywords may be extracted using a sequence of heuristics to convert the sentence set into the set of useful keywords. The set of useful keywords may then be associated to at least one attachment such that the keywords may subsequently be used to perform various indexing, searching, sorting, and to provide further context to the attachment.

Abstract: Computer-implemented system and methods are disclosed for optimizing the relative positions of sponsored and organic search results on a search results page displayed to a user, including calculating, by a search engine, a degree of commerciality of a search query; receiving the search query from a user by the search engine; and delivering, by the search engine to a browser of a user, a plurality of sponsored search results in at least two columns and a plurality of organic search results in at least a third column of one or more search results pages, wherein a layout of the at least three columns depends on the degree of commerciality of the search query.

Abstract: A system and method is described herein that automatically determines if a user of a search engine is conducting a research mission and then provides one or more research tools, one or more specialized searches, one or more directed ads, and/or one or more marketplace events responsive to determining that the research mission is being conducted. The automatic provision of various events and/or tools responsive to determination of the research mission can advantageously improve the experience of the user conducting the research mission.

Abstract: A graphic representation resulting from a user interacting with a user interface operating on a user device is received over a network. The graphic representation corresponds to a portion of a desired graphic character of a graphic character set (e.g. Chinese). The graphic representation is analyzed to select a plurality of graphic characters of the graphic character set that are a probable match of the graphic representation. The plurality of probable graphic characters are transmitted back to the user. A selection of one of the plurality of probable graphic characters is received over the network. A plurality of suggested search terms are identified to the user. Each suggested search term comprises at least one graphic character from the graphic character set. One of the plurality of suggested search terms is selected to be used to conduct an Internet search. An Internet search is then conducted using the selected search term.