2514 search results - page 99 / 503 » On the Computation of Approximations of Database Queries |
301
click to vote
ICDE
2008
IEEE
16 years 7 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
177
click to vote
FCCM
2006
IEEE
16 years 13 days ago
2006
IEEE
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
172
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
213
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
302
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...