4894 search results - page 297 / 979 » The Guarding Problem - Complexity and Approximation |
170
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
337
click to vote
DAC
2011
ACM
14 years 6 months ago
2011
ACM
In this paper, a new sparse approximation technique is proposed for incremental power grid analysis. Our proposed method is motivated by the observation that when a power grid net...
289
Voted
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
273
click to vote
ICDE
2004
IEEE
16 years 8 months ago
2004
IEEE
We examine the problem of evaluating selection queries over imprecisely represented objects. Such objects are used either because they are much smaller in size than the precise on...
172
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...