416 search results - page 21 / 84 » Simple and Efficient Algorithm for Approximate Dictionary Ma... |
TIT
2010
13 years 2 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
CSCLP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
ICCV
2009
IEEE
15 years 19 days ago
2009
IEEE
In this paper, we present a novel algorithm for partial
intrinsic symmetry detection in 3D geometry. Unlike previous
work, our algorithm is based on a conceptually simple
and st...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
ISMIR
2000
Springer
13 years 11 months ago
2000
Springer
We present an efficient prototype for music information retrieval. The prototype uses bitparallel algorithms for locating transposition invariant matches of monophonic query melod...