42230 search results - page 7974 / 8446 » Algorithms and Complexity Results for |
194
click to vote
MASCOTS
2007
15 years 8 months ago
2007
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
216
click to vote
SIROCCO
2008
15 years 8 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
202
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
177
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n p...
194
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...