Sciweavers

1163 search results - page 81 / 233
» Embedding into Bipartite Graphs
Sort
View
ICPR
2010
IEEE
13 years 10 months ago
Lipreading: A Graph Embedding Approach
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...
Ziheng Zhou, Guoying Zhao, Matti Pietikäinen
COMPGEOM
2007
ACM
14 years 12 hour ago
Embedding 3-polytopes on a small grid
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 ...
Ares Ribó Mor, Günter Rote, Andr&eacut...
CCCG
2009
13 years 9 months ago
Colored Simultaneous Geometric Embeddings and Universal Pointsets
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...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
COMPGEOM
2003
ACM
14 years 1 months ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
COCOON
2008
Springer
13 years 10 months ago
Probe Ptolemaic Graphs
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
David B. Chandler, Maw-Shang Chang, Ton Kloks, Van...