4843 search results - page 289 / 969 » The Shortcut Problem - Complexity and Approximation |
239
click to vote
ICDE
2004
IEEE
16 years 5 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...
228
click to vote
ICDE
2004
IEEE
16 years 5 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...
135
Voted
PODS
2004
ACM
16 years 4 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...
160
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
117
click to vote
SPIRE
2005
Springer
15 years 9 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...