2295 search results - page 216 / 459 » Learning Overcomplete Representations |
161
click to vote
ESANN
2001
15 years 8 months ago
2001
This paper illustrates how canonical correlation analysis can be used for designing efficient visual operators by learning. The approach is highly task oriented and what constitute...
177
click to vote
NAACL
2001
15 years 8 months ago
2001
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
191
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
188
click to vote
APIN
2004
15 years 6 months ago
2004
A rough self-organizing map (RSOM) with fuzzy discretization of feature space is described here. Discernibility reducts obtained using rough set theory are used to extract domain k...
192
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
In this paper we propose a framework for learning a regression function form a set of local features in an image. The regression is learned from an embedded representation that re...