1115 search results - page 84 / 223 » Separating Shape Graphs |
139
Voted
FCT
2003
Springer
15 years 7 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
156
click to vote
EMMCVPR
2005
Springer
15 years 8 months ago
2005
Springer
We consider the use of medial surfaces to represent symmetries of cts. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree o...
97
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC (S) of S is define...
105
Voted
ICIP
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
JCT
2006
15 years 2 months ago
2006
Fix positive integers k , d , k, d such that k /d > k/d 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at leas...