2924 search results - page 242 / 585 » Lower Bounds in Distributed Computing |
122
click to vote
ICDCS
2010
IEEE
15 years 7 months ago
2010
IEEE
—Wireless communication is particularly vulnerable to signal jamming attacks. Spread spectrum mitigates such problem by spreading normal narrowband signals over a much wider band...
147
Voted
SIGMETRICS
2010
ACM
15 years 8 months ago
2010
ACM
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the ...
130
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We consider a convex unconstrained optimization problem that arises in a network of agents whose goal is to cooperatively optimize the sum of the individual agent objec...
161
Voted
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
122
Voted
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...