Sciweavers

286 search results - page 31 / 58
» Recognition Algorithm for Diamond-Free Graphs
Sort
View
SAC
2009
ACM
15 years 8 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
CORR
2010
Springer
88views Education» more  CORR 2010»
15 years 2 months ago
A characterization of b-perfect graphs
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...
Chính T. Hoàng, Frédér...
TCSV
2008
175views more  TCSV 2008»
15 years 1 months ago
Expandable Data-Driven Graphical Modeling of Human Actions Based on Salient Postures
This paper presents a graphical model for learning and recognizing human actions. Specifically, we propose to encode actions in a weighted directed graph, referred to as action gra...
Wanqing Li, Zhengyou Zhang, Zicheng Liu
JCT
2008
84views more  JCT 2008»
15 years 1 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
WWW
2008
ACM
16 years 2 months ago
Graph theoretical framework for simultaneously integrating visual and textual features for efficient web image clustering
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
Manjeet Rege, Ming Dong, Jing Hua