17770 search results - page 2953 / 3554 » A Generalization of Forward-Backward Algorithm |
178
click to vote
PR
2002
15 years 6 months ago
2002
Computing correspondences between pairs of images is fundamental to all structures from motion algorithms. Correlation is a popular method to estimate similarity between patches o...
237
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
182
click to vote
RSA
2002
15 years 6 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
173
click to vote
TC
1998
15 years 6 months ago
1998
A bipartite concentrator is a single stage sparse crossbar switching device that can connect any m of its n ≥ m inputs to its m outputs possibly without the ability to distingui...
166
click to vote
SIGIR
2002
ACM
15 years 6 months ago
2002
ACM
The intuition that different text classifiers behave in qualitatively different ways has long motivated attempts to build a better metaclassifier via some combination of classifie...