Sciweavers

688 search results - page 53 / 138
» Computing with subspaces
Sort
View
ICPR
2010
IEEE
14 years 8 months ago
Learning Non-Linear Dynamical Systems by Alignment of Local Linear Models
Abstract—Learning dynamical systems is one of the important problems in many fields. In this paper, we present an algorithm for learning non-linear dynamical systems which works...
Masao Joko, Yoshinobu Kawahara, Takehisa Yairi
LMCS
2006
79views more  LMCS 2006»
14 years 9 months ago
Computably Based Locally Compact Spaces
tract Stone Duality) is a re-axiomatisation of general topology in which the topology on a space is treated, not as an infinitary lattice, but as an exponential object of the same...
Paul Taylor 0002
CAV
2009
Springer
218views Hardware» more  CAV 2009»
15 years 10 months ago
Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
Abstract. We propose a novel, sound, and complete Simplex-based algorithm for solving linear inequalities over integers. Our algorithm, which can be viewed as a semantic generaliza...
Isil Dillig, Thomas Dillig, Alex Aiken
NIPS
2008
14 years 11 months ago
Diffeomorphic Dimensionality Reduction
This paper introduces a new approach to constructing meaningful lower dimensional representations of sets of data points. We argue that constraining the mapping between the high a...
Christian Walder, Bernhard Schölkopf
84
Voted
ICPR
2004
IEEE
15 years 10 months ago
Bayesian Face Recognition Based on Gaussian Mixture Models
Bayesian analysis is a popular subspace based face recognition method. It casts the face recognition task into a binary classification problem with each of the two classes, intrap...
Xiaogang Wang, Xiaoou Tang