1149 search results - page 39 / 230 » Minimally non-Pfaffian graphs |
COMBINATORICS
2007
14 years 11 months ago
2007
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
107
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...
116
click to vote
FCT
2003
Springer
15 years 5 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
103
click to vote
ICCV
2007
IEEE
16 years 1 months ago
2007
IEEE
We formulate multi-view 3D shape reconstruction as the computation of a minimum cut on the dual graph of a semiregular, multi-resolution, tetrahedral mesh. Our method does not ass...
105
click to vote
ICIP
2008
IEEE
16 years 1 months ago
2008
IEEE
In many neurophysiological studies, understanding the neuronal circuitry of the brain requires detailed 3D models of the nerve cells and their synapses. Typically, researchers bui...