Sciweavers

709 search results - page 81 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
VLDB
1994
ACM
118views Database» more  VLDB 1994»
15 years 10 months ago
Query Optimization by Predicate Move-Around
A new type of optimization, called predicate move-around, ia introduced. It is shown how this optimization `considerably improvea the efficiency of evaluating SQL queries that hav...
Alon Y. Levy, Inderpal Singh Mumick, Yehoshua Sagi...
DMSN
2007
ACM
15 years 10 months ago
Similarity-aware query allocation in sensor networks with multiple base stations
In this paper, we consider a large scale sensor network comprising multiple, say K, base stations and a large number of wireless sensors. Such an infrastructure is expected to be ...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
16 years 6 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
COMCOM
2006
213views more  COMCOM 2006»
15 years 6 months ago
Energy efficient information dissemination protocols by negotiation for wireless sensor networks
In this paper we consider a distributed and efficient information dissemination and retrieval system for wireless sensor networks. In such a system each sensor node operates auton...
Dandan Liu, Xiaodong Hu, Xiaohua Jia
PAMI
2008
208views more  PAMI 2008»
15 years 6 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...