Sciweavers

511 search results - page 40 / 103
» The intrinsic dimensionality of graphs
Sort
View
NIPS
2003
13 years 11 months ago
Gaussian Processes in Reinforcement Learning
We exploit some useful properties of Gaussian process (GP) regression models for reinforcement learning in continuous state spaces and discrete time. We demonstrate how the GP mod...
Carl Edward Rasmussen, Malte Kuss
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 10 months ago
Non-Negative Matrix Factorization, Convexity and Isometry
Traditional Non-Negative Matrix Factorization (NMF) [19] is a successful algorithm for decomposing datasets into basis function that have reasonable interpretation. One problem of...
Nikolaos Vasiloglou, Alexander G. Gray, David V. A...
IJCV
2006
115views more  IJCV 2006»
13 years 10 months ago
An Analysis of Linear Subspace Approaches for Computer Vision and Pattern Recognition
: Linear subspace analysis (LSA) has become rather ubiquitous in a wide range of problems arising in pattern recognition and computer vision. The essence of these approaches is tha...
Pei Chen, David Suter
JMIV
2008
118views more  JMIV 2008»
13 years 10 months ago
Recognising Algebraic Surfaces from Two Outlines
Photographic outlines of 3 dimensional solids are robust and rich in information useful for surface reconstruction. This paper studies algebraic surfaces viewed from 2 cameras with...
Simon Collings, Ryszard Kozera, Lyle Noakes
CORR
2010
Springer
164views Education» more  CORR 2010»
13 years 10 months ago
Random Projection Trees Revisited
The Random Projection Tree (RPTREE) structures proposed in [1] are space partitioning data structures that automatically adapt to various notions of intrinsic dimensionality of da...
Aman Dhesi, Purushottam Kar