Sciweavers

1960 search results - page 230 / 392
» The Logic of Large Enough
Sort
View
SIGMOD
2001
ACM
200views Database» more  SIGMOD 2001»
14 years 10 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...
RECOMB
2010
Springer
14 years 5 months ago
The Clark Phase-able Sample Size Problem: Long-Range Phasing and Loss of Heterozygosity in GWAS
A phase transition is taking place today. The amount of data generated by genome resequencing technologies is so large that in some cases it is now less expensive to repeat the exp...
Bjarni V. Halldórsson, Derek Aguiar, Ryan T...
FC
2009
Springer
150views Cryptology» more  FC 2009»
14 years 5 months ago
Privacy-Preserving Information Markets for Computing Statistical Data
Abstract. Consider an “information market” where private and potentially sensitive data are collected, treated as commodity and processed into aggregated information with comme...
Aggelos Kiayias, Bülent Yener, Moti Yung
SIGCOMM
2009
ACM
14 years 5 months ago
DIRC: increasing indoor wireless capacity using directional antennas
The demand for wireless bandwidth in indoor environments such as homes and offices continues to increase rapidly. Although wireless technologies such as MIMO can reach link throug...
Xi Liu, Anmol Sheth, Michael Kaminsky, Konstantina...
ICASSP
2008
IEEE
14 years 5 months ago
An information theoretic approach to processing management
In region surveillance applications, sensors oftentimes accumulate an overwhelmingly large amount of data, making it infeasible to process all of the collected data in real-time. ...
Christopher M. Kreucher, Kevin M. Carter