Sciweavers

831 search results - page 92 / 167
» Finding Minimum Data Requirements Using Pseudo-independence
Sort
View
KDD
2001
ACM
163views Data Mining» more  KDD 2001»
14 years 10 months ago
The "DGX" distribution for mining massive, skewed data
Skewed distributions appear very often in practice. Unfortunately, the traditional Zipf distribution often fails to model them well. In this paper, we propose a new probability di...
Zhiqiang Bi, Christos Faloutsos, Flip Korn
SIGCOMM
2010
ACM
13 years 10 months ago
Generic and automatic address configuration for data center networks
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
Kai Chen, Chuanxiong Guo, Haitao Wu, Jing Yuan, Zh...
AAIM
2007
Springer
97views Algorithms» more  AAIM 2007»
14 years 2 months ago
Efficiency of Data Distribution in BitTorrent-Like Systems
BitTorrent (BT) in practice is a very efficient method to share data over a network of clients. In this paper we extend the recent work of Arthur and Panigrahy [1] on modelling the...
Ho-Leung Chan, Tak Wah Lam, Prudence W. H. Wong
PODS
2008
ACM
165views Database» more  PODS 2008»
14 years 10 months ago
Data exchange and schema mappings in open and closed worlds
In the study of data exchange one usually assumes an openworld semantics, making it possible to extend instances of target schemas. An alternative closed-world semantics only move...
Leonid Libkin, Cristina Sirangelo
EDBT
2004
ACM
122views Database» more  EDBT 2004»
14 years 10 months ago
Sketch-Based Multi-query Processing over Data Streams
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...