Sciweavers

3837 search results - page 227 / 768
» Learning Approximate Consistencies
Sort
View
NECO
2007
127views more  NECO 2007»
15 years 6 months ago
Visual Recognition and Inference Using Dynamic Overcomplete Sparse Learning
We present a hierarchical architecture and learning algorithm for visual recognition and other visual inference tasks such as imagination, reconstruction of occluded images, and e...
Joseph F. Murray, Kenneth Kreutz-Delgado
NIPS
1990
15 years 8 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
ECCV
2002
Springer
16 years 9 months ago
Learning Shape from Defocus
We present a novel method for inferring three-dimensional shape from a collection of defocused images. It is based on the observation that defocused images are the null-space of ce...
Paolo Favaro, Stefano Soatto
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 7 months ago
Effective multi-label active learning for text classification
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
Bishan Yang, Jian-Tao Sun, Tengjiao Wang, Zheng Ch...
KSEM
2009
Springer
16 years 1 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer