3250 search results - page 83 / 650 » Parameterized Learning Complexity |
ALT
2005
Springer
15 years 9 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
99
Voted
PAMI
2008
15 years 17 days ago
2008
This paper presents a new deformable modeling strategy aimed at integrating shape and appearance in a unified space. If we think traditional deformable models as "active cont...
68
Voted
ICALT
2007
IEEE
15 years 7 months ago
2007
IEEE
This paper describes how a knowledge model allows training software to evaluate spatial cognitive maps and provide tailored assistance.
107
Voted
AII
1989
15 years 4 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
111
click to vote
COLT
2000
Springer
15 years 5 months ago
2000
Springer
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...