Sciweavers

511 search results - page 47 / 103
» The intrinsic dimensionality of graphs
Sort
View
ICIP
2007
IEEE
14 years 4 months ago
Classification by Cheeger Constant Regularization
This paper develops a classification algorithm in the framework of spectral graph theory where the underlying manifold of a high dimensional data set is described by a graph. The...
Hsun-Hsien Chang, José M. F. Moura
AAAI
2004
13 years 11 months ago
A Correspondence Metric for Imitation
Abstract-- Learning by imitation and learning from demonstration have received considerable attention in robotics. However, very little research has been in the direction of provid...
R. Amit, Maja J. Mataric
TOG
2008
100views more  TOG 2008»
13 years 9 months ago
Interactive procedural street modeling
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...
Guoning Chen, Gregory Esch, Peter Wonka, Pascal M&...
CVPR
2007
IEEE
14 years 12 months ago
Sparse Kernels for Bayes Optimal Discriminant Analysis
Discriminant Analysis (DA) methods have demonstrated their utility in countless applications in computer vision and other areas of research ? especially in the C class classificat...
Aleix M. Martínez, Onur C. Hamsici
COMPGEOM
2009
ACM
14 years 4 months ago
Persistent cohomology and circular coordinates
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of lo...
Vin de Silva, Mikael Vejdemo-Johansson