1115 search results - page 83 / 223 » Separating Shape Graphs |
93
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
This paper deals with a new method for recognition of offline Handwritten noncompound Devnagari Characters in two stages. It uses two well known and established pattern recognitio...
COMGEO
2004
ACM
15 years 17 days ago
2004
ACM
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
PAKDD
2010
ACM
15 years 4 months ago
2010
ACM
Abstract. We report a surprising, persistent pattern in large sparse social graphs, which we term EigenSpokes. We focus on large Mobile Call graphs, spanning about 186K nodes and m...
129
click to vote
PAMI
2007
15 years 6 days ago
2007
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
89
Voted
JMIV
2008
15 years 21 days ago
2008
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...