Sciweavers

215 search results - page 3 / 43
» On the Linear Number of Matching Substrings
Sort
View
SODA
2001
ACM
87views Algorithms» more  SODA 2001»
13 years 6 months ago
A linear lower bound on index size for text retrieval
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
Erik D. Demaine, Alejandro López-Ortiz
CCCG
2008
13 years 7 months ago
Partial Matching of Planar Polygons Under Translation and Rotation
Curve matching is an important computational task for domains such as: reconstruction of archaeological fragments, forensics investigation, measuring melodic similarity, and model...
Eric McCreath
ISMB
1998
13 years 6 months ago
Compression of Strings with Approximate Repeats
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix
DIS
2005
Springer
13 years 11 months ago
Practical Algorithms for Pattern Based Linear Regression
We consider the problem of discovering the optimal pattern from a set of strings and associated numeric attribute values. The goodness of a pattern is measured by the correlation b...
Hideo Bannai, Kohei Hatano, Shunsuke Inenaga, Masa...