2947 search results - page 398 / 590 » Analyzing Program Analyses |
114
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
142
Voted
ESA
2007
Springer
15 years 8 months ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
131
Voted
CCGRID
2006
IEEE
15 years 8 months ago
2006
IEEE
— Over the years, the use of global grid environments have become widespread. In order to make applications robust against the dynamics of those grid environments it is essential...
131
click to vote
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— This paper focuses on the Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN) for pervasive information gathering. We develop simple and efficient data delivery schem...
121
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...