2084 search results - page 226 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
123
click to vote
MOBIHOC
2004
ACM
15 years 9 months ago
2004
ACM
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
— Energy consumption is a main issue of concern in wireless networks. Energy minimization increases the time that networks’ nodes work properly without recharging or substituti...
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
CRYPTO
2008
Springer
14 years 12 months ago
2008
Springer
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...