Sciweavers

6506 search results - page 1161 / 1302
» Algorithmic models for sensor networks
Sort
View
ICDCN
2011
Springer
14 years 1 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
CSCW
2006
ACM
15 years 4 months ago
Response times in N-user replicated, centralized, and proximity-based hybrid collaboration architectures
We evaluate response times, in N-user collaborations, of the popular centralized (client-server) and replicated (peer-to-peer) architectures, and a hybrid architecture in which ea...
Sasa Junuzovic, Prasun Dewan
CCR
2005
76views more  CCR 2005»
14 years 10 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
15 years 10 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
15 years 10 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
« Prev « First page 1161 / 1302 Last » Next »