Sciweavers

4930 search results - page 217 / 986
» Learning minimal abstractions
Sort
View
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 9 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
Daniel M. Kane
ECTEL
2010
Springer
15 years 5 months ago
Preferences in Multiple-View Open Learner Models
Abstract. Educational systems that model the user enable personalisation. Systems that open the model to the user to prompt reflection are increasingly common. These often offer a ...
Susan Bull, Inderdip Gakhal, Daniel Grundy, Matthe...
181
Voted
ALT
2010
Springer
15 years 1 months ago
PageRank Optimization in Polynomial Time by Stochastic Shortest Path Reformulation
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
Balázs Csanád Csáji, Rapha&eu...
ECCV
2006
Springer
16 years 8 months ago
Learning Compositional Categorization Models
Abstract. This contribution proposes a compositional approach to visual object categorization of scenes. Compositions are learned from the Caltech 101 database1 intermediate abstra...
Björn Ommer, Joachim M. Buhmann
ILP
2007
Springer
16 years 22 days ago
Building Relational World Models for Reinforcement Learning
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...