Sciweavers

3837 search results - page 113 / 768
» Learning Approximate Consistencies
Sort
View
ICIP
2010
IEEE
15 years 2 months ago
MVMP: Multi-view Matching Pursuit with geometry constraints
Sets of multi-view images that capture plenoptic information from different viewpoints are typically related by geometric constraints. The proper analysis of these constraints is ...
Ivana Tosic, Antonio Ortega, Pascal Frossard
GECCO
2006
Springer
196views Optimization» more  GECCO 2006»
15 years 8 months ago
An anticipatory approach to improve XCSF
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
Amin Nikanjam, Adel Torkaman Rahmani
ISTA
2003
15 years 5 months ago
Reflective Learning in Large Companies - can it work?
: A growing number of universities and companies are now becoming focused on promoting learning that is not merely instrumental. These aspirations refer to deep learning, transform...
Mihaela-Monica Vladoiu, Beatrice Matenciuc-Antones...
ICML
2004
IEEE
16 years 5 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 5 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan