Sciweavers

588 search results - page 63 / 118
» Computing the Dimension of Linear Subspaces
Sort
View
JAT
2006
64views more  JAT 2006»
13 years 10 months ago
Nonlinear function approximation: Computing smooth solutions with an adaptive greedy algorithm
Opposed to linear schemes, nonlinear function approximation allows to obtain a dimension independent rate of convergence. Unfortunately, in the presence of data noise typical algo...
Andreas Hofinger
CVPR
2008
IEEE
14 years 4 months ago
Manifold-Manifold Distance with application to face recognition based on image set
In this paper, we address the problem of classifying image sets, each of which contains images belonging to the same class but covering large variations in, for instance, viewpoin...
Ruiping Wang, Shiguang Shan, Xilin Chen, Wen Gao
GRC
2005
IEEE
14 years 3 months ago
Temporal granular logic for temporal data mining
— In this article, a formalism for a specific temporal data mining task (the discovery of rules, inferred from databases of events having a temporal dimension), is defined. The...
Paul Cotofrei, Kilian Stoffel
AAAI
2008
14 years 8 days ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han
ICARCV
2008
IEEE
170views Robotics» more  ICARCV 2008»
14 years 4 months ago
Mixed state estimation for a linear Gaussian Markov model
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
Argyris Zymnis, Stephen P. Boyd, Dimitry M. Gorine...