2084 search results - page 409 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
108
click to vote
KDD
2009
ACM
16 years 4 days ago
2009
ACM
The increasing availability of electronic communication data, such as that arising from e-mail exchange, presents social and information scientists with new possibilities for char...
ATAL
2009
Springer
15 years 6 months ago
2009
Springer
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
HSNMC
2004
Springer
15 years 5 months ago
2004
Springer
We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute t...
89
Voted
CIT
2006
Springer
15 years 3 months ago
2006
Springer
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...