2295 search results - page 265 / 459 » Learning Overcomplete Representations |
161
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Many important application areas of text classifiers demand high precision and it is common to compare prospective solutions to the performance of Naive Bayes. This baseline is us...
193
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...
255
click to vote
ICANN
2001
Springer
15 years 11 months ago
2001
Springer
Humans tend to group together related properties in order to understand complex phenomena. When modeling large problems with limited representational resources, it is important to...
182
click to vote
ECIR
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. We focus on two recently proposed algorithms in the family of “boosting”-based learners for automated text classification, AdaBoost.MH and AdaBoost.MHKR . While the ...
213
Voted
IJCV
2007
15 years 6 months ago
2007
In this paper, we present a novel image representation that renders it possible to access natural scenes by local semantic description. Our work is motivated by the continuing effo...