Search Results

Searching for directions is one of the most used features of map applications. This paper shares our vision on how Direction Services will change, with LLM-based chat assistants rapidly becoming an integral part of the underlying path search mechanism. ...

Map search engines compute the estimated time of arrival (ETA) from location A to location B by first performing local routing-engine optimization over a network of road segments. Once the optimal route candidates are identified their ETA is reevaluated ...

As people increasingly adopt a more flexible and mobile way of living, map applications and navigation services have gained increasingly in importance. In order for these services to be useful to their users, their providers need to ensure and maintain a ...

Recent works show that Transformer-based learning-to-rank (LTR) approaches can outperform previous well-established ranking methods, such as gradient-boosted decision trees (GBDT), on document and passage re-ranking problems. A common assumption in these ...

Inferring user behavior patterns in their daily location visits, i.e., where people go and how long they stay there, enables a variety of useful applications such as time management systems, new location recommendations, and the opportunity for ...

Predicting users daily location visits - when and where they will go, and how long they will stay - is key for making effective location-based recommendations. Knowledge of an upcoming day allows the suggestion of relevant alternatives (e.g., a new ...

Image search is a popular application on web search engines. Issuing a location-related query on an image search engine often returns multiple images of maps among the top ranked results. Traditionally, clicking on such images either opens the image in a ...

Image search is a popular application on web search engines. Issuing a location-related query in image search engines often returns multiple images of maps among the top ranked results. Traditionally, clicking on such images either opens the image in a ...

Given a set of GPS tracks on a road network and a number k, the K-Primary-Corridor (KPC) problem aims to identify k tracks as primary corridors such that the overall distance from all tracks to their closest primary corridors is minimized. The KPC ...

Real-time geocoders help users find precise locations in online mapping systems. Geocoding unstructured queries can be difficult, as users may describe map locations by referencing several spatially co-located entities (e.g., a business near a street ...

Given a collection of geo-located activities (e.g., Crime reports), ring-shaped hotspot detection (RHD) finds rings, where concentration of activities inside the ring is much higher than outside. RHD is important for the applications such as crime ...

It is imperative that for scalable solutions of GIS computations the modern hybrid architecture comprising a CPU-GPU pair is exploited fully. The existing parallel algorithms and data structures port reasonably well to multi-core CPUs, but poorly to ...

Given a set of trajectories on a road network, the goal of the All-Pair Network Trajectory Similarity (APNTS) problem is to calculate the similarity between all trajectories using the Network Hausdorff Distance. This problem is important for a variety ...

Increasingly, location-aware datasets are of a size, variety, and update rate that exceeds the capability of spatial computing technologies. This paper addresses the emerging challenges posed by such datasets, which we call Spatial Big Data SBD. SBD ...

Given a set of regions with activity counts at each time instant (e.g., a listing of countries with number of mass protests or disease cases over time) and a spatial neighbor relation, geo-referenced time-series summarization (GTS) finds k-full trees ...

Given a set of GPS trajectories on a road network, the goal of the k-Primary Corridors (k-PC) problem is to summarize trajectories into k groups, each represented by its most central trajectory. This problem is important to a variety of domains, such as ...

Increasingly, location-aware datasets are of a size, variety, and update rate that exceeds the capability of spatial computing technologies. This paper addresses the emerging challenges posed by such datasets, which we call Spatial Big Data (SBD). SBD ...

The Internet allows for near-total anonymity in online discussions and transactions; leading to challenges such as identity theft, spear phishing, cyber-bullying and lack of user-retailer trust for small online retailers. In an effort to restore ...

Given a set of operators and a spatio-temporal network, the goal of the Storing Spatio-Temporal Networks (SSTN) problem is to produce an efficient data storage method that minimizes disk I/O access costs. Storing and accessing spatio-temporal networks ...