Sciweavers

570 search results - page 15 / 114
» Intrinsic Geometries in Learning
Sort
View
COMPGEOM
2010
ACM
13 years 11 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
ICML
2007
IEEE
14 years 8 months ago
Neighbor search with global geometry: a minimax message passing algorithm
Neighbor search is a fundamental task in machine learning, especially in classification and retrieval. Efficient nearest neighbor search methods have been widely studied, with the...
Kye-Hyeon Kim, Seungjin Choi
ITS
2010
Springer
130views Multimedia» more  ITS 2010»
14 years 9 days ago
Coordinate Geometry Learning Environment with Game-Like Properties
Mily’s World is a learning environment for coordinate geometry that has game-like properties, that is, elements of games that are engaging such as cover story, graphical represen...
Dovan Rai, Joseph E. Beck, Neil T. Heffernan
ATAL
2010
Springer
13 years 8 months ago
Evolving policy geometry for scalable multiagent learning
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...
David B. D'Ambrosio, Joel Lehman, Sebastian Risi, ...
CVPR
2012
IEEE
11 years 10 months ago
Learning 3D object templates by hierarchical quantization of geometry and appearance spaces
This paper presents a method for learning 3D object templates from view labeled object images. The 3D template is defined in a joint appearance and geometry space, and is compose...
Wenze Hu