112 search results - page 8 / 23 » An Approximation Algorithm for Alphabet Indexing Problem |
SOFSEM
2004
Springer
15 years 5 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
107
click to vote
WWW
2006
ACM
16 years 8 days ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
LATIN
1998
Springer
15 years 3 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
BMCBI
2006
14 years 11 months ago
2006
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
ICDT
2005
ACM
15 years 5 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...