4843 search results - page 246 / 969 » The Shortcut Problem - Complexity and Approximation |
136
click to vote
MCS
2008
Springer
15 years 3 months ago
2008
Springer
Dynamical low-rank approximation is a differential-equation based approach to efficiently computing low-rank approximations to time-dependent large data matrices or to solutions o...
137
Voted
SODA
2008
ACM
15 years 5 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
127
click to vote
CPM
1999
Springer
15 years 8 months ago
1999
Springer
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
145
Voted
COMPGEOM
1997
ACM
15 years 7 months ago
1997
ACM
This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
107
click to vote
CIKM
1997
Springer
15 years 7 months ago
1997
Springer
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...