Sciweavers

90 search results - page 18 / 18
» Continuous obstructed nearest neighbor queries in spatial da...
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 5 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
ECCV
2008
Springer
14 years 6 months ago
SIFT Flow: Dense Correspondence across Different Scenes
While image registration has been studied in different areas of computer vision, aligning images depicting different scenes remains a challenging problem, closer to recognition tha...
Ce Liu, Jenny Yuen, Antonio B. Torralba, Josef Siv...
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
13 years 10 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
EDBT
2009
ACM
164views Database» more  EDBT 2009»
13 years 9 months ago
Fast object search on road networks
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search...
Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
W2GIS
2004
Springer
13 years 10 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou