1093 search results - page 23 / 219 » Clustering from Constraint Graphs |
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
ICFEM
2009
Springer
14 years 2 months ago
2009
Springer
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
INCDM
2010
Springer
13 years 8 months ago
2010
Springer
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
APVIS
2007
13 years 11 months ago
2007
The level-of-detail techniques presented in this paper enable a comprehensible interactive visualization of large and complex clustered graph layouts either in 2D or 3D. Implicit ...