1115 search results - page 80 / 223 » Separating Shape Graphs |
107
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place...
102
click to vote
SDM
2010
SIAM
15 years 2 months ago
2010
SIAM
Given large, multi-million node graphs (e.g., FaceBook, web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers of the...
116
Voted
ICMCS
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we use the three-dimensionaltopological shape information for human face identification. We propose a new method to represent 3D faces as a topological graph. Fine...
82
Voted
SIAMDM
2008
15 years 19 days ago
2008
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
135
Voted
ICIP
2000
IEEE
16 years 1 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...