Sciweavers

792 search results - page 85 / 159
» Computing Iceberg Queries Efficiently
Sort
View
TKDE
2010
195views more  TKDE 2010»
14 years 8 months ago
Query Processing Using Distance Oracles for Spatial Networks
—The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as findin...
Jagan Sankaranarayanan, Hanan Samet
ICPP
2007
IEEE
15 years 4 months ago
Difficulty-aware Hybrid Search in Peer-to-Peer Networks
—By combining an unstructured protocol with a DHT-based global index, hybrid peer-to-peer (P2P) improves search efficiency in terms of query recall and response time. The major c...
Hanhua Chen, Hai Jin, Yunhao Liu, Lionel M. Ni
MICS
2008
72views more  MICS 2008»
14 years 9 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
EDBT
2008
ACM
169views Database» more  EDBT 2008»
15 years 10 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
CVPR
2009
IEEE
16 years 5 months ago
Learning query-dependent prefilters for scalable image retrieval
We describe an algorithm for similar-image search which is designed to be efficient for extremely large collections of images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...