2084 search results - page 98 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
154
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
144
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
—In this paper the performance of unslotted ALOHA and CSMA are analyzed in spatially distributed wireless networks. Users/packets arrive randomly in space and time according to a...
141
click to vote
DIALM
2003
ACM
15 years 10 months ago
2003
ACM
A common way of storing spatio-temporal information about mobile devices is in the form of a 3D (2D geography + time) trajectory. We argue that when cellular phones and Personal D...
136
click to vote
MOBIHOC
2010
ACM
15 years 2 months ago
2010
ACM
Recent years have witnessed the emergence of shared sensor networks as integrated infrastructure for multiple applications. It is important to allocate multiple applications in a ...
160
click to vote
FPGA
2004
ACM
15 years 8 months ago
2004
ACM
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...