1091 search results - page 200 / 219 » Approximation in Databases |
169
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
194
Voted
DASFAA
2008
IEEE
16 years 1 months ago
2008
IEEE
State-of-the-art Peer-to-Peer Information Retrieval (P2P IR) systems suffer from their lack of response time guarantee especially with scale. To address this issue, a number of tec...
198
Voted
BIBE
2005
IEEE
16 years 10 days ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
184
Voted
PODS
2005
ACM
16 years 8 days ago
2005
ACM
Heavy hitters, which are items occurring with frequency above a given threshold, are an important aggregation and summary tool when processing data streams or data warehouses. Hie...
217
Voted
MDM
2005
Springer
16 years 6 days ago
2005
Springer
Data access prediction has been proposed as a mechanism to overcome latency lag, and more recently as a means of conserving energy in mobile systems. We present a fully adaptive p...