Sciweavers

339 search results - page 24 / 68
» Random Sampling Techniques in Parallel Computation
Sort
View
IEEEPACT
2007
IEEE
15 years 4 months ago
L1 Cache Filtering Through Random Selection of Memory References
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...
Yoav Etsion, Dror G. Feitelson
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
15 years 10 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
PODC
2004
ACM
15 years 3 months ago
Computation in networks of passively mobile finite-state sensors
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
Dana Angluin, James Aspnes, Zoë Diamadi, Mich...
ICDE
2006
IEEE
192views Database» more  ICDE 2006»
15 years 11 months ago
Approximating Aggregation Queries in Peer-to-Peer Networks
Peer-to-peer databases are becoming prevalent on the Internet for distribution and sharing of documents, applications, and other digital media. The problem of answering large scal...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Va...
72
Voted
P2P
2009
IEEE
126views Communications» more  P2P 2009»
15 years 4 months ago
Robust Lifetime Measurement in Large-Scale P2P Systems with Non-Stationary Arrivals
—Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work [26] has shown that direct sampling...
Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri...