4009 search results - page 261 / 802 » Clustering on Complex Graphs |
154
Voted
ESA
2009
Springer
16 years 5 days ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
188
click to vote
ICPR
2008
IEEE
16 years 1 days 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...
153
Voted
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
162
click to vote
KES
2004
Springer
15 years 11 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 ...
169
click to vote
PCM
2004
Springer
15 years 11 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...