Sciweavers

644 search results - page 76 / 129
» Decomposition Complexity
Sort
View
93
Voted
ICPR
2010
IEEE
15 years 2 months ago
A Fast Extension for Sparse Representation on Robust Face Recognition
We extend a recent Sparse Representation-based Classification (SRC) algorithm for face recognition to work on 2D images directly, aiming to reduce the computational complexity whil...
Hui-Ning Qiu, Duc-Son Pham, Wanquan Liu, Svetha Ve...
105
Voted
ICONIP
2007
15 years 2 months ago
Principal Component Analysis for Sparse High-Dimensional Data
Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...
Tapani Raiko, Alexander Ilin, Juha Karhunen
118
Voted
VMV
2003
163views Visualization» more  VMV 2003»
15 years 1 months ago
Real-Time Volumetric Intersections of Deforming Objects
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
Bruno Heidelberger, Matthias Teschner, Markus H. G...
108
Voted
EAAI
2007
90views more  EAAI 2007»
15 years 16 days ago
AI techniques in modelling, assignment, problem solving and optimization
This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods—relying on, e.g., artificial neural networks and search techniques...
Zsolt János Viharos, Zsolt Kemény
78
Voted
RIA
2006
60views more  RIA 2006»
15 years 15 days ago
GACS : une approche ascendante pour la coordination spatiale
ABSTRACT. The design of spatial coordination mechanisms for dynamical and continuous multiagent setting is a difficult challenge. While the top-down decomposition approach is ineff...
Fabien Flacher, Olivier Sigaud