Sciweavers

78 search results - page 9 / 16
» Finding Top-k Approximate Answers to Path Queries
Sort
View
AAAI
2007
13 years 9 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
12 years 11 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
EDBT
2009
ACM
124views Database» more  EDBT 2009»
13 years 10 months ago
Processing probabilistic spatio-temporal range queries over moving objects with uncertainty
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
Bruce S. E. Chung, Wang-Chien Lee, Arbee L. P. Che...
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
14 years 8 months ago
Accelerating Profile Queries in Elevation Maps
Elevation maps are a widely used spatial data representation in geographical information systems (GIS). Paths on elevation maps can be characterized by profiles, which describe re...
Feng Pan, Wei Wang 0010, Leonard McMillan
ALGORITHMICA
2011
13 years 2 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal