263 search results - page 29 / 53 » Splitting of Learnable Classes |
COLT
2005
Springer
15 years 3 months ago
2005
Springer
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
ENGL
2007
14 years 9 months ago
2007
In this paper we introduce a finite automaton called partial finite automaton to recognize partial languages. We have defined three classes of partial languages, viz., local pa...
TCS
2008
14 years 9 months ago
2008
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold's (1967) model of learning in th...
105
click to vote
STACS
1994
Springer
15 years 1 months ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...