Sciweavers

13214 search results - page 90 / 2643
» Pseudorandomness for network algorithms
Sort
View
ECCC
2011
207views ECommerce» more  ECCC 2011»
15 years 1 months ago
Balls and Bins: Smaller Hash Families and Faster Evaluation
A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
PODC
2012
ACM
13 years 8 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
STOC
2003
ACM
100views Algorithms» more  STOC 2003»
16 years 6 months ago
Simpler and better approximation algorithms for network design
Anupam Gupta, Amit Kumar, Tim Roughgarden
SENSYS
2006
ACM
16 years 10 days ago
Data compression algorithms for energy-constrained devices in delay tolerant networks
Sensor networks are fundamentally constrained by the difficulty and energy expense of delivering information from sensors to sink. Our work has focused on garnering additional si...
Christopher M. Sadler, Margaret Martonosi
ADHOCNETS
2009
Springer
16 years 1 months ago
Improved Topology Control Algorithms for Simple Mobile Networks
Topology control is the problem of assigning powers to the nodes of an ad hoc network so as to create a specified network topology while minimizing the energy consumed by the netw...
Fei Che, Errol L. Lloyd, Liang Zhao