Sciweavers

1091 search results - page 200 / 219
» Approximation in Databases
Sort
View
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 2 months ago
Sketching Sampled Data Streams
—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...
Florin Rusu, Alin Dobra
DASFAA
2008
IEEE
106views Database» more  DASFAA 2008»
14 years 1 months ago
Flood Little, Cache More: Effective Result-Reuse in P2P IR Systems
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...
Christian Zimmer, Srikanta J. Bedathur, Gerhard We...
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 1 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
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 ...
Abhijit Pol, Tamer Kahveci
PODS
2005
ACM
96views Database» more  PODS 2005»
14 years 29 days ago
Space complexity of hierarchical heavy hitters in multi-dimensional data streams
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...
John Hershberger, Nisheeth Shrivastava, Subhash Su...
MDM
2005
Springer
165views Communications» more  MDM 2005»
14 years 27 days ago
STEP: Self-Tuning Energy-safe Predictors
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...
James Larkby-Lahet, Ganesh Santhanakrishnan, Ahmed...