Sciweavers

1612 search results - page 270 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
IMC
2006
ACM
15 years 3 months ago
On unbiased sampling for unstructured peer-to-peer networks
This paper addresses the difficult problem of selecting representative samples of peer properties (e.g., degree, link bandwidth, number of files shared) in unstructured peer-to-p...
Daniel Stutzbach, Reza Rejaie, Nick G. Duffield, S...
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Generalized scoring rules and the frequency of coalitional manipulability
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...
Lirong Xia, Vincent Conitzer
WISEC
2010
ACM
15 years 2 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
PPOPP
2012
ACM
13 years 5 months ago
Deterministic parallel random-number generation for dynamic-multithreading platforms
Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be bui...
Charles E. Leiserson, Tao B. Schardl, Jim Sukha
PLDI
2005
ACM
15 years 3 months ago
Scalable statistical bug isolation
We present a statistical debugging algorithm that isolates bugs in programs containing multiple undiagnosed bugs. Earlier statistical algorithms that focus solely on identifying p...
Ben Liblit, Mayur Naik, Alice X. Zheng, Alexander ...