1170 search results - page 146 / 234 » How Fast Is Too Fast |
130
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
124
Voted
KDD
2002
ACM
16 years 3 months ago
2002
ACM
Images are highly complex multidimensional signals, with rich and complicated information content. For this reason they are difficult to analyze through a unique automated approach...
140
click to vote
SIGMOD
2002
ACM
16 years 3 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...
120
Voted
IPSN
2010
Springer
15 years 10 months ago
2010
Springer
We present Virtual High-resolution Time (VHT), a powerproportional time-keeping service that offers a baseline power draw of a low-speed clock (e.g. 32 kHz crystal), but provides...
141
Voted
SSDBM
2008
IEEE
15 years 9 months ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...