57 search results - page 10 / 12 » On-Line Approximate String Matching with Bounded Errors |
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
100
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
IROS
2006
IEEE
15 years 3 months ago
2006
IEEE
Abstract— This paper introduces a method of building topological maps using sequences of images and the approximate string matching algorithm, which is commonly used in DNA seque...