2750 search results - page 207 / 550 » The complexity of learning SUBSEQ(A) |
202
click to vote
CC
2010
Springer
15 years 4 months ago
2010
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose that t...
216
click to vote
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
Nearly every structured prediction problem in computer vision requires approximate inference due to large and complex dependencies among output labels. While graphical models prov...
206
click to vote
ACMSE
2010
ACM
15 years 1 months ago
2010
ACM
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
155
click to vote
COGSCI
2011
15 years 1 months ago
2011
This paper examines whether adults can adapt to novel accents of their native language that contain unfamiliar context-dependent phonological alternations. In two experiments, Fre...
172
click to vote
COGSR
2011
15 years 1 months ago
2011
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...