Displaying 270 resources
The Silent (R)evolution of SAT
The Propositional Satisfiability problem (SAT) was the first to be shown NP-complete by Cook and Levin. SAT remained the embodiment of theoretical worst-case hardness.
Algorithms for manifold learning
The technical report presents popular methods for mapping data into a low-dimensional manifold (nonlinear dimensionality reduction).
Geometric data analysis based on manifold learning with applications for image understanding
The conference paper gives in the first section a brief and easy understandable introduction into the basics of Riemannian geometry.
Terse notes on Riemannian geometry
The technical report gives a compact introduction into the basic definitions and theorems of Riemannian geometry, Lie groups & Lie algebras and symmetric spaces.
Learning on manifolds
The conference paper provides a brief introduction into manifolds from a computer vision perspective. Important manifolds for this research field, like symmetric positive definite matrices and affine transformation matrices, are presented.
Article/Books/eBooks
An introduction to manifolds
This book provides an introduction to the theory of manifolds in an easy readable way. Key concepts of manifolds, angent spaces and Lie group / Lie algebra are presented.