1036 search results - page 35 / 208 » Algorithms for Learning Regular Expressions |
158
click to vote
KDD
2009
ACM
16 years 6 months ago
2009
ACM
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...
178
click to vote
CA
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents an efficient method of learning motion control for autonomous animated characters. The method uses a non parametric learning approach which identifies non line...
161
click to vote
NIPS
2008
15 years 7 months ago
2008
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
140
click to vote
SAS
2001
Springer
15 years 10 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
141
click to vote
ICML
2007
IEEE
16 years 6 months ago
2007
IEEE
The l-bfgs limited-memory quasi-Newton method is the algorithm of choice for optimizing the parameters of large-scale log-linear models with L2 regularization, but it cannot be us...