Sciweavers

110 search results - page 14 / 22
» Fast Nearest Neighbor Search on Road Networks
Sort
View
PVLDB
2010
151views more  PVLDB 2010»
13 years 6 months ago
A Generic Framework for Handling Uncertain Data with Local Correlations
Data uncertainty is ubiquitous in many real-world applications such as sensor/RFID data analysis. In this paper, we investigate uncertain data that exhibit local correlations, tha...
Xiang Lian, Lei Chen 0002
CVPR
2004
IEEE
14 years 9 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
JMLR
2010
111views more  JMLR 2010»
13 years 2 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
KDD
2000
ACM
110views Data Mining» more  KDD 2000»
13 years 11 months ago
An empirical analysis of techniques for constructing and searching k-dimensional trees
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
Douglas A. Talbert, Douglas H. Fisher
PVLDB
2010
146views more  PVLDB 2010»
13 years 6 months ago
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
Michael Rice, Vassilis J. Tsotras