1837 search results - page 110 / 368 » Learning From Ambiguous Examples |
200
click to vote
LPKR
1997
Springer
15 years 10 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
156
click to vote
CVPR
2006
IEEE
16 years 8 months ago
2006
IEEE
We investigate to what extent `bag of visual words' models can be used to distinguish categories which have significant visual similarity. To this end we develop and optimize...
166
click to vote
ESOP
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Type classes in Haskell allow programmers to define functions that can be used on a set of different types, with a potentially different implementation in each case. For ...
177
click to vote
CVPR
1997
IEEE
16 years 8 months ago
1997
IEEE
A framework for learning parameterized models of optical flow from image sequences is presented. A class of motions is represented by a set of orthogonal basis flow fields that ar...
178
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
In many real-world domains, undirected graphical models such as Markov random fields provide a more natural representation of the dependency structure than directed graphical mode...