2924 search results - page 222 / 585 » Lower Bounds in Distributed Computing |
153
click to vote
SECON
2007
IEEE
15 years 10 months ago
2007
IEEE
—In this paper, we consider multi-hop wireless mesh networks, where each router node is equipped with multiple radio interfaces and multiple channels are available for communicat...
128
click to vote
ACL
2007
15 years 5 months ago
2007
A Bloom filter (BF) is a randomised data structure for set membership queries. Its space requirements are significantly below lossless information-theoretic lower bounds but it ...
134
click to vote
TMC
2008
15 years 3 months ago
2008
In this paper, we consider multihop wireless mesh networks, where each router node is equipped with multiple radio interfaces, and multiple channels are available for communication...
152
click to vote
TSP
2010
14 years 10 months ago
2010
We study the estimation of a Gaussian source by a Gaussian wireless sensor network (WSN) where L distributed sensors transmit noisy observations of the source through a fading Gau...
157
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...