10054 search results - page 156 / 2011 » On the Complexity of Function Learning |
105
click to vote
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
Boosting is a popular approach for building accurate classifiers. Despite the initial popular belief, boosting algorithms do exhibit overfitting and are sensitive to label noise. ...
113
Voted
CACM
2010
14 years 11 months ago
2010
As it becomes increasingly viable to capture, store, and share large amounts of image and video data, automatic image analysis is crucial to managing visual information. Many prob...
100
Voted
STOC
1996
ACM
15 years 4 months ago
1996
ACM
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Given multiple time sequences with missing values, we propose DynaMMo which summarizes, compresses, and finds latent variables. The idea is to discover hidden variables and learn ...
103
click to vote
ALT
2004
Springer
15 years 9 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...