684 search results - page 18 / 137 » On embedding well-separable graphs |
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we propose a novel graph embedding method for the problem of lipreading. To characterize the temporal connections among video frames of the same utterance, a new di...
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
100
Voted
CCCG
2009
14 years 10 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
SIAMDM
2010
14 years 4 months ago
2010
Abstract. The conjecture of Bollob
PKDD
2009
Springer
15 years 4 months ago
2009
Springer
Most existing semi-supervised learning methods are based on the smoothness assumption that data points in the same high density region should have the same label. This assumption, ...