2031 search results - page 181 / 407 » On Tree-Constrained Matchings and Generalizations |
AIRS
2004
Springer
15 years 3 months ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Recent research has shown the effectiveness of using sparse coding(Sc) to solve many computer vision problems. Motivated by the fact that kernel trick can capture the nonlinear sim...
106
click to vote
CVIU
2011
14 years 1 months ago
2011
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...
SIGMOD
2011
ACM
14 years 1 months ago
2011
ACM
Over the last decade the cost of producing genomic sequences has dropped dramatically due to the current so called “next-gen” sequencing methods. However, these next-gen seque...
171
click to vote
3DIM
2011
IEEE
13 years 10 months ago
2011
IEEE
Addressing the image correspondence problem by feature matching is a central part of computer vision and 3D inference from images. Consequently, there is a substantial amount of w...