384 search results - page 23 / 77 » On s-hamiltonian-connected line graphs |
JCT
2006
13 years 8 months ago
2006
Let V be a vector space of dimension v over a field of order q. The q-Kneser graph has the kdimensional subspaces of V as its vertices, where two subspaces and are adjacent if and...
ICIP
2008
IEEE
14 years 3 months ago
2008
IEEE
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
APVIS
2011
12 years 8 months ago
2011
We present the results of a study comparing five directed-edge representations for use in 2D, screen-based node-link diagrams. The goal of this work is to extend the understandin...
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...