2084 search results - page 336 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Sensor nodes are very weak computers that get distributed at random on a surface. Once deployed, they must wake up and form a radio network. Sensor network bootstrapping research t...
102
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
MOBICOM
2009
ACM
15 years 4 months ago
2009
ACM
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
106
click to vote
CCS
2006
ACM
15 years 1 months ago
2006
ACM
In biometric identification, a fingerprint is typically represented as a set of minutiae which are 2D points. A method [4] to protect the fingerprint template hides the minutiae b...
127
click to vote
ESA
2007
Springer
15 years 1 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...