122 search results - page 18 / 25 » Vector Algorithms for Approximate String Matching |
134
click to vote
ML
2002
ACM
15 years 4 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
124
click to vote
SIGIR
1998
ACM
15 years 8 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
180
click to vote
TIFS
2008
15 years 4 months ago
2008
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
129
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
158
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...