Sciweavers

684 search results - page 54 / 137
» On embedding well-separable graphs
Sort
View
ICPR
2008
IEEE
15 years 10 months ago
Scale invariant face recognition using probabilistic similarity measure
In video surveillance, the size of face images is very small. However, few works have been done to investigate scale invariant face recognition. Our experiments on appearance-base...
Zhifei Wang, Zhenjiang Miao
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
15 years 10 months ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...
APPML
2007
101views more  APPML 2007»
15 years 4 months ago
Extension of a theorem of Whitney
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
Paul C. Kainen, Shannon Overbay
ICRA
2005
IEEE
125views Robotics» more  ICRA 2005»
15 years 10 months ago
On the Use of UML for Modeling Physical Systems
— The aim of this paper is to provide a unified language for modeling both control software and physical plants in real time control systems. This is done by embedding the bond ...
Cristian Secchi, Cesare Fantuzzi, Marcello Bonf&ea...
NIPS
2001
15 years 5 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi