5100 search results - page 290 / 1020 » The Linear Complexity of a Graph |
124
click to vote
WAW
2009
Springer
15 years 11 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
158
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a novel graph cut based segmentation approach with shape priors. The model incorporates statistical shape prior information with the active contour without edg...
142
click to vote
KES
2004
Springer
15 years 10 months ago
2004
Springer
In this paper we discuss how graph mining system is applied to sales transaction data so as to understand consumer behavior. First, existing research of consumer behavior analysis ...
148
click to vote
PCM
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we propose a new scheme for the geometry coding of three-dimensional (3-D) mesh models using a dual graph. In order to compress the mesh geometry information, we gen...
153
click to vote
AE
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...