Sciweavers

2323 search results - page 32 / 465
» Power optimization for connectivity problems
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 9 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICIP
2009
IEEE
13 years 6 months ago
Optimized energy allocation in battery powered image sensor networks
We investigate energy allocation strategies in image sensor networks for the purpose of maximizing the network operational lifetime. For the application scenarios that we consider...
Chao Yu, Gaurav Sharma
FOCS
2004
IEEE
14 years 15 days ago
Optimal Power-Down Strategies
We consider the problem of selecting threshold times to transition a device to low-power sleep states during an idle period. The two-state case in which there is a single active a...
John Augustine, Sandy Irani, Chaitanya Swamy
ICALP
2010
Springer
14 years 1 months ago
Network Design via Core Detouring for Problems without a Core
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
Fabrizio Grandoni, Thomas Rothvoß
ICC
2009
IEEE
157views Communications» more  ICC 2009»
14 years 3 months ago
Optimal Relay Assignment and Power Allocation in Selection Based Cooperative Cellular Networks
—We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have sug...
Sachin Kadloor, Raviraj Adve