Sciweavers

5792 search results - page 1053 / 1159
» Communicating With Multiple Agents
Sort
View
IMC
2003
ACM
14 years 2 months ago
Best-path vs. multi-path overlay routing
Time-varying congestion on Internet paths and failures due to software, hardware, and configuration errors often disrupt packet delivery on the Internet. Many aproaches to avoidi...
David G. Andersen, Alex C. Snoeren, Hari Balakrish...
SAC
2003
ACM
14 years 2 months ago
TinyGALS: A Programming Model for Event-Driven Embedded Systems
Networked embedded systems such as wireless sensor networks are usually designed to be event-driven so that they are reactive and power efficient. Programming embedded systems wit...
Elaine Cheong, Judith Liebman, Jie Liu, Feng Zhao
WPES
2003
ACM
14 years 2 months ago
Reusable anonymous return channels
Mix networks are used to deliver messages anonymously to recipients, but do not straightforwardly allow the recipient of an anonymous message to reply to its sender. Yet the abili...
Philippe Golle, Markus Jakobsson
SIGMOD
2010
ACM
221views Database» more  SIGMOD 2010»
14 years 1 months ago
Low overhead concurrency control for partitioned main memory databases
Database partitioning is a technique for improving the performance of distributed OLTP databases, since “single partition” transactions that access data on one partition do no...
Evan P. C. Jones, Daniel J. Abadi, Samuel Madden
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
14 years 1 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
« Prev « First page 1053 / 1159 Last » Next »