1036 search results - page 15 / 208 » Algorithms for Learning Regular Expressions |
NIPS
2004
13 years 8 months ago
2004
In this paper we propose to combine two powerful ideas, boosting and manifold learning. On the one hand, we improve ADABOOST by incorporating knowledge on the structure of the dat...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
VLDB
1990
ACM
13 years 11 months ago
1990
ACM
In previous papers we have proposed a graphical query language for expressing traversal recursions in labelled, directed graphs. A fundamental feature of the language is the use o...
IPL
2011
13 years 2 months ago
2011
We provide sample complexity of the problem of learning halfspaces with monotonic noise, using the regularized least squares algorithm in the reproducing kernel Hilbert spaces (RKH...
JMLR
2010
13 years 2 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...