4926 search results - page 130 / 986 » Two Graph Algorithms On an Associative Computing Model |
123
Voted
IEICET
2007
15 years 2 months ago
2007
We compare the convergence performance of different numerical schemes for computing the fundamental matrix from point correspondences over two images. First, we state the problem ...
109
Voted
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
129
click to vote
CIBCB
2006
IEEE
15 years 8 months ago
2006
IEEE
— Successful biological image analysis usually requires satisfactory segmentations to identify regions of interest as an intermediate step. Here we present a novel graphical mode...
131
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
Abstract—This paper presents a systematic methodology to derive and classify fast algorithms for linear transforms. The approach is based on the algebraic signal processing theor...
114
click to vote
WEA
2004
Springer
15 years 8 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...