Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for scheduling operations represented on a computation graph. One of the methods receiving, by a computation graph system, a request to generate a schedule for processing a computation graph, obtaining data representing the computation graph generating a separator of the computation graph; and generating the schedule to perform the operations represented in the computation graph, wherein generating the schedule comprises: initializing the schedule with zero nodes; for each node in the separator: determining whether the node has any predecessor nodes in the computation graph, when the node has any predecessor nodes, adding the predecessor nodes to the schedule, and adding the node in the schedule, and adding to the schedule each node in each subgraph that is not a predecessor to any node in the separator on the computation graph.

Abstract: Computer-implemented methods and systems of determining semantic place data include receiving a plurality of location data reports from a plurality of mobile devices, partitioning them into localized segments, and estimating a geographic region bucket for each segment. For clustering canopies of localized segments identified as satisfying a potential geographic overlap characterization, an overlap score is calculated that correlates the overlap among actual geographic regions covered by movement of the mobile devices generating the localized segments in that given clustering canopy. A data structure that provides a hierarchical clustering configuration of the localized segments in each geographic region bucket is generated from the determined overlap scores. Additional semantic data for nodes in the data structure can also be provided.

Abstract: Computer-implemented methods and systems of determining semantic place data include receiving a plurality of location data reports from a plurality of mobile devices, partitioning them into localized segments, and estimating a geographic region bucket for each segment. For clustering canopies of localized segments identified as satisfying a potential geographic overlap characterization, an overlap score is calculated that correlates the overlap among actual geographic regions covered by movement of the mobile devices generating the localized segments in that given clustering canopy. A data structure that provides a hierarchical clustering configuration of the localized segments in each geographic region bucket is generated from the determined overlap scores. Additional semantic data for nodes in the data structure can also be provided.

Abstract: A method is disclosed for diminishing user advertisement fatigue to increase click efficiency, including receiving a search query or browsing action from a user; analyzing a plurality of advertisements available for delivery to a search results page in response to the search query or browsing action; arranging the plurality of advertisements in a queue so that, when delivered sequentially from the queue, no advertisement is viewable more than once on a search results page, to thereby reduce advertisement fatigue of the user; and delivering the queued plurality of advertisements sequentially to the search results pages of the user.

Abstract: Subject matter disclosed herein relates to document classification and/or automated document classifier tuning. In an example embodiment, a document received from a user computing platform in an online database stored in a memory of a server computing platform may be classified based, at least in part, on a training set. Also for an example embodiment, the training set may be modified based, at least in part, on statistics gathered from user browsing behavior.

Abstract: Subject matter disclosed herein relates to document classification and/or automated document classifier tuning.

Abstract: A method is disclosed for diminishing user advertisement fatigue to increase click efficiency, including receiving a search query or browsing action from a user; analyzing a plurality of advertisements available for delivery to a search results page in response to the search query or browsing action; arranging the plurality of advertisements in a queue so that, when delivered sequentially from the queue, no advertisement is viewable more than once on a search results page, to thereby reduce advertisement fatigue of the user; and delivering the queued plurality of advertisements sequentially to the search results pages of the user.

Abstract: A method of generating a diversified vertical search results listing, including listing attribute values related to search criteria and their frequency of occurrence to create a plurality of listings; creating a plurality of interval bands based on the plurality of listings; generating a random diversity score for each listing over a substantially uniform distribution within each of the plurality of bands; and sorting a set of search results for diversified listing in response to a user searching for the search criteria according to the diversity score of each listing.