4009 search results - page 33 / 802 » Clustering on Complex Graphs |
109
click to vote
FCT
2007
Springer
15 years 1 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
ICCV
2003
IEEE
16 years 1 months ago
2003
IEEE
We propose a unified approach for summarization based on the analysis of video structures and video highlights. Our approach emphasizes both the content balance and perceptual qua...
ENDM
2006
14 years 11 months ago
2006
Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring proble...
ICML
2005
IEEE
16 years 18 days ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
109
click to vote
ECCV
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We describe a clustering approach with the emphasis on detecting coherent structures in a complex dataset, and illustrate its effectiveness with computer vision applicat...