Sciweavers

478 search results - page 91 / 96
» A simple expected running time analysis for randomized
Sort
View
DCOSS
2006
Springer
14 years 2 days ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
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...
Wei Mo, Daji Qiao, Zhengdao Wang
OOPSLA
2004
Springer
14 years 1 months ago
Finding and preventing run-time error handling mistakes
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...
Westley Weimer, George C. Necula
CLOUD
2010
ACM
14 years 1 months ago
Fluxo: a system for internet service programming by non-expert developers
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...
Emre Kiciman, V. Benjamin Livshits, Madanlal Musuv...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
14 years 2 months ago
Impatient Backoff Algorithm: Fairness in a Distributed Ad-Hoc MAC
— 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...
Rajarshi Gupta, Jean C. Walrand
CORR
2007
Springer
105views Education» more  CORR 2007»
13 years 8 months ago
Relative-Error CUR Matrix Decompositions
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...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...