4865 search results - page 295 / 973 » The Complexity of Graph Connectivity |
181
click to vote
ICPR
2010
IEEE
15 years 8 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...
169
click to vote
ESANN
2007
15 years 8 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
169
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Given a point set P in the plane, the Delaunay graph with respect to axis-parallel rectangles is a graph defined on the vertex set P, whose two points p, q P are connected by an ...
153
click to vote
ESANN
2003
15 years 8 months ago
2003
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
162
click to vote
APPML
2007
15 years 6 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...