1952 search results - page 212 / 391 » Complete partitions of graphs |
179
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
116
click to vote
GBRPR
2007
Springer
16 years 21 days ago
2007
Springer
In this paper, we propose a highly robust point-matching method (Graph Transformation Matching - GTM) relying on finding the consensus graph emerging from putative matches. Such m...
189
click to vote
NLDB
2007
Springer
16 years 20 days ago
2007
Springer
Most of Information Retrieval (IR) systems are still based on bag of word paradigm. This is a strong limitation if one needs high precision answers. For example, in restricted doma...
148
click to vote
ACSD
2005
IEEE
16 years 5 days ago
2005
IEEE
This paper presents our approach to model distributed discrete event simulation systems in the framework of distributed graph transformation. We use distributed typed attributed g...
153
click to vote
MICCAI
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. An N-dimensional image is divided into "object" and "background" segments using a graph cut approach. A graph is formed by connecting all pairs of nei...