1160 search results - page 59 / 232 » Query Processing and Optimization for Pictorial Query Trees |
ICDCS
2005
IEEE
15 years 3 months ago
2005
IEEE
Database queries, in particular, event-driven continuous queries, are useful for many pervasive computing applications, such as video surveillance. In order to enable these applic...
ICDT
2001
ACM
15 years 2 months ago
2001
ACM
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
111
click to vote
SSDBM
2005
IEEE
15 years 3 months ago
2005
IEEE
The widespread use of sensor networks in scientific and engineering applications leads to increased demand on the efficient computation of the collected sensor data. Recent rese...
156
click to vote
SIGMOD
2006
ACM
15 years 10 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
112
click to vote
SDM
2012
SIAM
13 years 14 days ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...