3250 search results - page 370 / 650 » Parameterized Learning Complexity |
125
click to vote
PKDD
2009
Springer
15 years 11 months ago
2009
Springer
Most accurate predictions are typically obtained by learning machines with complex feature spaces (as e.g. induced by kernels). Unfortunately, such decision rules are hardly access...
137
click to vote
SCIA
2005
Springer
15 years 10 months ago
2005
Springer
We propose reliable outdoor object detection on mobile phone imagery from off-the-shelf devices. With the goal to provide both robust object detection and reduction of computation...
143
click to vote
ISLPED
2004
ACM
15 years 10 months ago
2004
ACM
Designers have invested much effort in developing accurate branch predictors with short learning periods. Such techniques rely on exploiting complex and relatively large structure...
140
click to vote
COLT
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
137
click to vote
ECML
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Many complex control problems are not amenable to traditional controller design. Not only is it difficult to model real systems, but often it is unclear what kind of beha...