511 search results - page 69 / 103 » The intrinsic dimensionality of graphs |
APPROX
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...
AVSS
2009
IEEE
13 years 7 months ago
2009
IEEE
A comparison of several approaches that use graph matching and cascade filtering for landmark localisation in 3D face data is presented. For the first method, we apply the structur...
PRL
2010
13 years 8 months ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
CVPR
2008
IEEE
15 years 8 hour ago
2008
IEEE
We present a novel structure learning method, Max Margin AND/OR Graph (MM-AOG), for parsing the human body into parts and recovering their poses. Our method represents the human b...
SDM
2007
SIAM
13 years 11 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...