Sciweavers

4894 search results - page 915 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
14 years 8 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
SIGMOD
2009
ACM
120views Database» more  SIGMOD 2009»
14 years 8 months ago
Kernel-based skyline cardinality estimation
The skyline of a d-dimensional dataset consists of all points not dominated by others. The incorporation of the skyline operator into practical database systems necessitates an ef...
Zhenjie Zhang, Yin Yang, Ruichu Cai, Dimitris Papa...
SIGMOD
2006
ACM
116views Database» more  SIGMOD 2006»
14 years 7 months ago
Fast range-summable random variables for efficient aggregate estimation
Exact computation for aggregate queries usually requires large amounts of memory ? constrained in data-streaming ? or communication ? constrained in distributed computation ? and ...
Florin Rusu, Alin Dobra
SIGMOD
2002
ACM
246views Database» more  SIGMOD 2002»
14 years 7 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 7 months ago
Data Bubbles: Quality Preserving Performance Boosting for Hierarchical Clustering
In this paper, we investigate how to scale hierarchical clustering methods (such as OPTICS) to extremely large databases by utilizing data compression methods (such as BIRCH or ra...
Markus M. Breunig, Hans-Peter Kriegel, Peer Kr&oum...