453 search results - page 80 / 91 » Tight bounds for the partial-sums problem |
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
LICS
2008
IEEE
14 years 1 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
INFOCOM
2003
IEEE
14 years 20 days ago
2003
IEEE
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...