12519 search results - page 428 / 2504 » Approximation Problems Categories |
176
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...
187
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The low-rank matrix approximation problem involves finding of a rank k version of a m ? n matrix AAA, labeled AAAk, such that AAAk is as "close" as possible to the best ...
301
click to vote
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...
280
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...
178
click to vote
PODS
2004
ACM
16 years 7 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...