176 search results - page 20 / 36 » The complexity of properly learning simple concept classes |
LREC
2010
13 years 10 months ago
2010
Today's natural language processing systems are growing more complex with the need to incorporate a wider range of language resources and more sophisticated statistical metho...
COLT
1997
Springer
14 years 29 days ago
1997
Springer
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
ALT
1995
Springer
14 years 11 days ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
ECCV
2004
Springer
14 years 10 months ago
2004
Springer
Data association (obtaining correspondences) is a ubiquitous problem in computer vision. It appears when matching image features across multiple images, matching image features to ...
PODS
2010
ACM
14 years 1 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...