Sciweavers

2853 search results - page 165 / 571
» On the Efficiency of Provenance Queries
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 6 months ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim
EDBT
2008
ACM
140views Database» more  EDBT 2008»
16 years 6 months ago
Dynamic skyline queries in metric spaces
Skyline query is of great importance in many applications, such as multi-criteria decision making and business planning. In particular, a skyline point is a data object in the dat...
Lei Chen 0002, Xiang Lian
PERCOM
2006
ACM
16 years 6 months ago
Distributed Cross-Layer Scheduling for In-Network Sensor Query Processing
In-network sensor query processing is a cross-layer design paradigm in which networked sensor nodes process data acquisitional queries in collaboration with one another. As power ...
Hejun Wu, Qiong Luo, Wenwei Xue
VLDB
2005
ACM
115views Database» more  VLDB 2005»
15 years 12 months ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...