154 search results - page 27 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
STACS
2010
Springer
15 years 4 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
169
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
CCS
2007
ACM
15 years 3 months ago
2007
ACM
Human Desoxyribo-Nucleic Acid (DNA) sequences offer a wealth of information that reveal, among others, predisposition to various diseases and paternity relations. The breadth and...
100
click to vote
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
This paper presents a stagewise least square (SLS) loss function for classification. It uses a least square form within each stage to approximate a bounded monotonic nonconvex los...