3607 search results - page 636 / 722 » Learning with structured sparsity |
133
click to vote
CLOR
2006
15 years 8 months ago
2006
The chapter describes visual classification by a hierarchy of semantic fragments. In fragment-based classification, objects within a class are represented by common sub-structures ...
138
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
102
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Automatically assessing the value of bioavailability from the chemical structure of a molecule is a very important issue in biomedicine and pharmacology. In this paper, we present...
136
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
143
click to vote
ICCV
1995
IEEE
15 years 7 months ago
1995
IEEE
A general-purpose object indexingtechnique is described that combines the virtues of principal component analysis with the favorable matching properties of high-dimensional spaces...