35 search results - page 2 / 7 » Practical Experiments with Regular Approximation of Context-... |
WIA
2009
Springer
14 years 25 days ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
NLPRS
2001
Springer
13 years 10 months ago
2001
Springer
Incremental parsing with a context free grammar produces partial syntactic structures for an initial fragment on the word-by-word basis. Owing to the syntactic ambiguity, however,...
ICML
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper addresses feature selection techniques for classification of high dimensional data, such as those produced by microarray experiments. Some prior knowledge may be availa...
APLAS
2006
ACM
14 years 7 days ago
2006
ACM
The static determination of approximated values of string expressions has many potential applications. For instance, approximated string values may be used to check the validity an...
ACL
2009
13 years 4 months ago
2009
Stochastic gradient descent (SGD) uses approximate gradients estimated from subsets of the training data and updates the parameters in an online fashion. This learning framework i...