17760 search results - page 3496 / 3552 » A Generalization of the Massey-Ding Algorithm |
PAMI
1998
13 years 7 months ago
1998
—As an object moves through the field of view of a camera, the images of the object may change dramatically. This is not simply due to the translation of the object across the im...
PR
2002
13 years 7 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...
SIAMCOMP
1998
13 years 7 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...
RSA
2002
13 years 7 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...
TC
1998
13 years 7 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...