Sciweavers

1612 search results - page 140 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
SOSP
2003
ACM
16 years 1 months ago
Performance debugging for distributed systems of black boxes
Many interesting large-scale systems are distributed systems of multiple communicating components. Such systems can be very hard to debug, especially when they exhibit poor perfor...
Marcos Kawazoe Aguilera, Jeffrey C. Mogul, Janet L...
PODS
2010
ACM
232views Database» more  PODS 2010»
15 years 10 months ago
Optimal sampling from distributed streams
A fundamental problem in data management is to draw a sample of a large data set, for approximate query answering, selectivity estimation, and query planning. With large, streamin...
Graham Cormode, S. Muthukrishnan, Ke Yi, Qin Zhang
CORR
2008
Springer
118views Education» more  CORR 2008»
15 years 5 months ago
Learning Low-Density Separators
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
Shai Ben-David, Tyler Lu, Dávid Pál,...
SP
2005
IEEE
156views Security Privacy» more  SP 2005»
15 years 10 months ago
Distributed Detection of Node Replication Attacks in Sensor Networks
The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze...
Bryan Parno, Adrian Perrig, Virgil D. Gligor
TSP
2010
14 years 11 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat