215 search results - page 10 / 43 » On the Linear Number of Matching Substrings |
COMBINATORICS
1999
13 years 7 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically...
IR
2008
13 years 8 months ago
2008
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
This paper considers the objectives of accurate stereo matching, especially at object boundaries, robustness against recording or illumination changes and efficiency of the calcul...
ISAAC
2004
Springer
14 years 1 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...