Abstract: Real-time busyness information is for a public place is computed in a privacy-sensitive way, and provided for display in relation to historical busyness information. An aggregate amount of real-time location information available for a particular public place is measured (410), and used to determine (420) whether the public place is privacy-qualified. If the public place is privacy-qualified, real-time busyness information is computed (440) for the public place based on the real-time location information. Further, it is determined (450) whether the computed real-time busyness information is accuracy-qualified, based on a comparison of the real-time busyness information to historical busyness information. If both qualifications are met, the real-time busyness information is output (470) for display or to another application.

Abstract: Real-time busyness information is for a public place is computed in a privacy-sensitive way, and provided for display in relation to historical busyness information. An aggregate amount of real-time location information available for a particular public place is measured (410), and used to determine (420) whether the public place is privacy-qualified. If the public place is privacy-qualified, real-time busyness information is computed (440) for the public place based on the real-time location information. Further, it is determined (450) whether the computed real-time busyness information is accuracy-qualified, based on a comparison of the real-time busyness information to historical busyness information. If both qualifications are met, the real-time busyness information is output (470) for display or to another application.

Abstract: Real-time busyness information is for a public place is computed in a privacy-sensitive way, and provided for display in relation to historical busyness information. An aggregate amount of real-time location information available for a particular public place is measured (410), and used to determine (420) whether the public place is privacy-qualified. If the public place is privacy-qualified, real-time busyness information is computed (440) for the public place based on the real-time location information. Further, it is determined (450) whether the computed real-time busyness information is accuracy-qualified, based on a comparison of the real-time busyness information to historical busyness information. If both qualifications are met, the real-time busyness information is output (470) for display or to another application.

Abstract: Real-time busyness information is for a public place is computed in a privacy-sensitive way, and provided for display in relation to historical busyness information. An aggregate amount of real-time location information available for a particular public place is measured (410), and used to determine (420) whether the public place is privacy-qualified. If the public place is privacy-qualified, real-time busyness information is computed (440) for the public place based on the real-time location information. Further, it is determined (450) whether the computed real-time busyness information is accuracy-qualified, based on a comparison of the real-time busyness information to historical busyness information. If both qualifications are met, the real-time busyness information is output (470) for display or to another application.

Abstract: Real-time busyness information is for a public place is computed in a privacy-sensitive way, and provided for display in relation to historical busyness information. An aggregate amount of real-time location information available for a particular public place is measured (410), and used to determine (420) whether the public place is privacy-qualified. If the public place is privacy-qualified, real-time busyness information is computed (440) for the public place based on the real-time location information. Further, it is determined (450) whether the computed real-time busyness information is accuracy-qualified, based on a comparison of the real-time busyness information to historical busyness information. If both qualifications are met, the real-time busyness information is output (470) for display or to another application.

Abstract: A method for autonomous navigation based on integrating sensor data with known aeronautical coordinates in three-dimensional space using simultaneous localisation and mapping methodologies. In particular, a method may include accessing subsets of multiple types of sensor data, aligning subsets of sensor data relative to a global coordinate system based on the multiple types of sensor data to form aligned sensor data, and generating datasets of three-dimensional map data. The method further includes detecting a change in data relative to at least two datasets of the three-dimensional map data and applying the change in data to form updated three-dimensional map data. The change in data may be representative of a state change of an environment at which the sensor data is sensed. The state change of the environment may be related to the presence or absences of an object located therein.

Abstract: A method for motion estimation based on perceived blur due to motion between a first image frame and a second image frame of a digital video sequence comprises estimating a motion vector between the frames for each of a plurality of pixel blocks in the first and second image frames. A patch motion vector is then estimated for each of a plurality of patches of the motion vectors based on one of vectors in each patch and motion vectors in proximate patches. The patch motion vector of its corresponding patch is allocated to each pixel in the first frame. A system and computer program for motion estimation based on perceived blur is also provided.

Abstract: The present invention provides for a decentralized and distributed functionality of a plurality of cameras to offload central processing, reduce heat dissipation, and process images for collision detection and flight path management using different categories of camera.

Abstract: Real-time busyness information is for a public place is computed in a privacy-sensitive way, and provided for display in relation to historical busyness information. An aggregate amount of real-time location information available for a particular public place is measured (410), and used to determine (420) whether the public place is privacy-qualified. If the public place is privacy-qualified, real-time busyness information is computed (440) for the public place based on the real-time location information. Further, it is determined (450) whether the computed real-time busyness information is accuracy-qualified, based on a comparison of the real-time busyness information to historical busyness information. If both qualifications are met, the real-time busyness information is output (470) for display or to another application.

Abstract: Systems, methods, and computer program products involve identifying a first IP block having a first set of IP addresses and a second IP block having a second set of IP addresses, the first set of IP addresses different from the second set of IP addresses. A first expected number of IP reassignments for the first IP block can be determined. A first number of IP reassignments between the first IP block and the second IP block can be identified. The first number of IP reassignments can be compared against the first expected number of IP reassignments. The first IP block and the second IP block can be merged into an IP allocation pool based, at least in part, on the comparison.

Abstract: Systems, methods, and computer program products involve identifying a first IP block having a first set of IP addresses and a second IP block having a second set of IP addresses, the first set of IP addresses different from the second set of IP addresses. A first expected number of IP reassignments for the first IP block can be determined. A first number of IP reassignments between the first IP block and the second IP block can be identified. The first number of IP reassignments can be compared against the first expected number of IP reassignments. The first IP block and the second IP block can be merged into an IP allocation pool based, at least in part, on the comparison.

Abstract: Systems, methods, and computer program products involve identifying a first IP block having a first set of IP addresses and a second IP block having a second set of IP addresses, the first set of IP addresses different from the second set of IP addresses. A first expected number of IP reassignments for the first IP block can be determined. A first number of IP reassignments between the first IP block and the second IP block can be identified. The first number of IP reassignments can be compared against the first expected number of IP reassignments. The first IP block and the second IP block can be merged into an IP allocation pool based, at least in part, on the comparison.

Abstract: Systems, methods, and computer program products involve identifying a first IP block having a first set of IP addresses and a second IP block having a second set of IP addresses, the first set of IP addresses different from the second set of IP addresses. A first expected number of IP reassignments for the first IP block can be determined. A first number of IP reassignments between the first IP block and the second IP block can be identified. The first number of IP reassignments can be compared against the first expected number of IP reassignments. The first IP block and the second IP block can be merged into an IP allocation pool based, at least in part, on the comparison.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for improving geographic targeting of digital content. In some implementations, a targeting request that identifies a target geographic region is received. Groups of geographic regions that each include the target geographic region and at least another geographic region are identified. Combined targeting accuracies are computed for the groups of geographic regions. One or more of the groups of geographic regions are selected based on their combined targeting accuracies being higher than a targeting accuracy for the target geographic region. Data describing the selected one or more groups of geographic regions is provided for output in response to the targeting request.

Abstract: Configurations for providing a multi-tier hierarchy to manage geographical data are disclosed. The subject technology identifies a first geographic location and determines where, in a geographic hierarchy, the first location belongs, including associating one or more labels with the first location. Each label is associated with a respective level in the geographic hierarchy that includes the first location. The subject technology identifies a second, different geographic location and determines where, in the geographic hierarchy, the second location belongs. One or more different number of levels in the geographic hierarchy are determined to associate with the second location than a number of levels in the geographic hierarchy associated with the first location. The subject technology associates one or more labels for the one or more different number of levels with the second location, and uses respective labels to target content delivered to users associated with the first or second locations.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for selecting score improvements. In one aspect, a method includes obtaining search query data, each search query being associated user selection data that identifies which search results were selected by users; obtaining a plurality of score improvement lists, each score improvement list being an ordered list of adjusters, wherein the adjusters are serially applied to initial scores of a group of search results to determine a final scoring of the search results; testing the plurality of score improvement lists comprising: iteratively selecting pairs of score improvement lists from a pool of score improvement lists, and determining, for each pair of score improvement lists, a winning score improvement list and a losing score improvement list based on the search query data, repeating testing until ending criteria are reached; and selecting one or more score improvement lists.

Abstract: Systems, methods, and computer program products involve identifying a first IP block having a first set of IP addresses and a second IP block having a second set of IP addresses, the first set of IP addresses different from the second set of IP addresses. A first expected number of IP reassignments for the first IP block can be determined. A first number of IP reassignments between the first IP block and the second IP block can be identified. The first number of IP reassignments can be compared against the first expected number of IP reassignments. The first IP block and the second IP block can be merged into an IP allocation pool based, at least in part, on the comparison.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for improving geographic targeting of digital content. One of the methods includes receiving a targeting request that identifies a target geographic region; identifying one or more groups of geographic regions that each include at least two geographic regions, including the target geographic region, wherein the one or more groups of geographic regions are identified based on respective combined targeting accuracies, the respective combined targeting accuracy of each of the one or more groups being higher than a targeting accuracy for the target geographic region; and providing data describing the identified one or more groups of geographic regions in response to the targeting request.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for identifying geographic features. In one aspect, a method includes receiving a query. Geographic features are identified, each geographic feature being associated with one or more names, each geographic feature being associated with at least one name that includes the query. A feature-query score is computed for each geographic feature, including: for each name of the geographic feature that includes the query, identifying a computed feature-name score, wherein the feature-name score is computed based on a count of a number of occurrences of the name in a query log, wherein each occurrence is attributed to the feature; and computing the feature-query score based on the identified feature-name scores. The geographic features are ranked according to the feature-query scores.

Abstract: Among other disclosed subject matter, a computer-implemented method includes receiving a first, a second and a third network address mapping. The method includes mapping each of the network addresses in the first, second and third network address mappings to respective first, second and third locations. The method includes determining, for each of the network addresses in the first, second and third network address mappings, location agreements. The method includes determining a first and second network address mapping agreement rate, a first and third network address mapping agreement rate, and a second and third network address mapping agreement rate, respectively based on location agreements determined for each of the network addresses. The method includes determining a confidence level associated with the first network address mapping based on the agreement rates.