Sciweavers

2514 search results - page 199 / 503
» On the Computation of Approximations of Database Queries
Sort
View
VLDB
2009
ACM
381views Database» more  VLDB 2009»
16 years 6 months ago
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN
In this paper, we study the problem of continuous monitoring of reverse k nearest neighbor queries. Existing continuous reverse nearest neighbor monitoring techniques are sensitive...
Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei...
ICCV
2003
IEEE
15 years 12 months ago
Active Concept Learning for Image Retrieval in Dynamic Databases
Concept learning in content-based image retrieval (CBIR) systems is a challenging task. This paper presents an active concept learning approach based on mixture model to deal with...
Anlei Dong, Bir Bhanu
MIDDLEWARE
2005
Springer
16 years 2 days ago
Adaptive query processing in mobile environment
These last years, the evolution of nomadic terminals and mobile networks has yield to the development of the ubiquitous computing. In this context, actual query evaluation and opt...
Hocine Grine, Thierry Delot, Sylvain Lecomte
ITICSE
2004
ACM
16 years 1 days ago
Use of large databases for group projects at the nexus of teaching and research
Final year, group (capstone) projects in computing disciplines are often expected to fill multiple roles: in addition to allowing students to learn important domain-specific knowl...
Richard C. Thomas, Rebecca Mancy
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
16 years 8 months ago
Efficient Evaluation of All-Nearest-Neighbor Queries
The All Nearest Neighbor (ANN) operation is a commonly used primitive for analyzing large multi-dimensional datasets. Since computing ANN is very expensive, in previous works R*-t...
Yun Chen, Jignesh M. Patel