Sciweavers

511 search results - page 24 / 103
» The intrinsic dimensionality of graphs
Sort
View
WSCG
2004
185views more  WSCG 2004»
13 years 11 months ago
Automatic Fitting and Control of Complex Freeform Shapes in 3-D
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...
Yu Song, Joris S. M. Vergeest, Chensheng Wang
PAMI
2008
391views more  PAMI 2008»
13 years 9 months ago
Riemannian Manifold Learning
Recently, manifold learning has been widely exploited in pattern recognition, data analysis, and machine learning. This paper presents a novel framework, called Riemannian manifold...
Tong Lin, Hongbin Zha
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 4 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
APVIS
2008
13 years 11 months ago
A Novel Visualization System for Expressive Facial Motion Data Exploration
Facial emotions and expressive facial motions have become an intrinsic part of many graphics systems and human computer interaction applications. The dynamics and high dimensional...
Tanasai Sucontphunt, Xiaoru Yuan, Qing Li, Zhigang...
COLT
2008
Springer
13 years 11 months ago
Time Varying Undirected Graphs
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman