Sciweavers

16128 search results - page 2707 / 3226
» Distributed network scheduling
Sort
View
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 6 months ago
Relationship privacy: output perturbation for queries with joins
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...
Vibhor Rastogi, Michael Hay, Gerome Miklau, Dan Su...
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
16 years 6 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
PPOPP
2010
ACM
16 years 3 months ago
The LOFAR correlator: implementation and performance analysis
LOFAR is the first of a new generation of radio telescopes. Rather than using expensive dishes, it forms a distributed sensor network that combines the signals from many thousands...
John W. Romein, P. Chris Broekema, Jan David Mol, ...
ICDCN
2010
Springer
16 years 1 months ago
Authenticated Byzantine Generals in Dual Failure Model
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...
Anuj Gupta, Prasant Gopal, Piyush Bansal, Kannan S...
SPAA
2009
ACM
16 years 1 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
« Prev « First page 2707 / 3226 Last » Next »