4930 search results - page 165 / 986 » Learning minimal abstractions |
101
click to vote
EUROCOLT
1999
Springer
15 years 5 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
COLT
2001
Springer
15 years 5 months ago
2001
Springer
The notion of embedding a class of dichotomies in a class of linear half spaces is central to the support vector machines paradigm. We examine the question of determining the mini...
120
click to vote
ALT
2003
Springer
15 years 4 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
120
click to vote
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
To learn a new visual category from few examples, prior knowledge from unlabeled data as well as previous related categories may be useful. We develop a new method for transfer le...
109
Voted
ISCC
2006
IEEE
15 years 6 months ago
2006
IEEE
Online monitoring of a physical phenomenon over a geographical area is a popular application of sensor networks. Networks representative of this class of applications are typicall...