782 search results - page 87 / 157 » Can a Parser be Generated from Examples |
135
Voted
ALT
2001
Springer
16 years 26 days ago
2001
Springer
This paper concerns the design of a Support Vector Machine (SVM) appropriate for the learning of Boolean functions. This is motivated by the need of a more sophisticated algorithm ...
171
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Current approaches to pose estimation and tracking can be classified into two categories: generative and discriminative. While generative approaches can accurately determine human...
146
click to vote
JACM
2007
15 years 3 months ago
2007
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
141
click to vote
COLING
2002
15 years 3 months ago
2002
A number of machine translation systems based on the learning algorithms are presented. These methods acquire translation rules from pairs of similar sentences in a bilingual text...
127
Voted
TCC
2009
Springer
16 years 4 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...