478 search results - page 91 / 96 » A simple expected running time analysis for randomized |
177
click to vote
DCOSS
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
167
click to vote
OOPSLA
2004
Springer
15 years 10 months ago
2004
Springer
It is difficult to write programs that behave correctly in the presence of run-time errors. Existing programming language features often provide poor support for executing clean-u...
173
click to vote
CLOUD
2010
ACM
15 years 10 months ago
2010
ACM
Over the last 10–15 years, our industry has developed and deployed many large-scale Internet services, from e-commerce to social networking sites, all facing common challenges i...
140
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— Many distributed multiple access (MAC) protocols use an exponential backoff mechanism. In that mechanism, a node picks a random backoff time uniformly in an interval that doubl...
156
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...