Sciweavers

3809 search results - page 628 / 762
» Randomized Broadcast in Networks
Sort
View
CASES
2006
ACM
14 years 3 months ago
Automated compile-time and run-time techniques to increase usable memory in MMU-less embedded systems
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
Lan S. Bai, Lei Yang, Robert P. Dick
SIGMETRICS
2005
ACM
147views Hardware» more  SIGMETRICS 2005»
14 years 3 months ago
Denial-of-service resilience in peer-to-peer file sharing systems
Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. Th...
Dan Dumitriu, Edward W. Knightly, Aleksandar Kuzma...
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
14 years 3 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
SPAA
1997
ACM
14 years 1 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
PVLDB
2010
220views more  PVLDB 2010»
13 years 4 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel