7868 search results - page 412 / 1574 » Learning by Answer Sets |
175
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Hardness results for maximum agreement problems have close connections to hardness results for proper learning in computational learning theory. In this paper we prove two hardnes...
187
click to vote
JMLR
2010
15 years 1 months ago
2010
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
177
click to vote
NIPS
2000
15 years 8 months ago
2000
It has long been known that lateral inhibition in neural networks can lead to a winner-take-all competition, so that only a single neuron is active at a steady state. Here we show...
163
click to vote
PATAT
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Within the field of software agents, there has been increasing interest in automating the process of calendar scheduling in recent years. Calendar (or meeting) schedulin...
196
click to vote
NIPS
2001
15 years 8 months ago
2001
The paper studies machine learning problems where each example is described using a set of Boolean features and where hypotheses are represented by linear threshold elements. One ...