1100 search results - page 81 / 220 » Approximate distance oracles |
CPM
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
CPM
2009
Springer
15 years 4 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...
ADC
2008
Springer
15 years 4 months ago
2008
Springer
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
15 years 3 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
IS
2008
14 years 10 months ago
2008
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...