262 search results - page 11 / 53 » Approximating the 2-Interval Pattern Problem |
CIKM
2009
Springer
14 years 4 months ago
2009
Springer
Graph data are subject to uncertainties in many applications due to incompleteness and imprecision of data. Mining uncertain graph data is semantically different from and computat...
CPM
2008
Springer
13 years 11 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
GECCO
2007
Springer
14 years 4 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
MCS
2010
Springer
13 years 8 months ago
2010
Springer
Some aspects of goal-oriented a posteriori error estimation are addressed in the context of steady convection-diffusion equations. The difference between the exact and approxima...
MCS
2008
Springer
13 years 9 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...