47 search results - page 7 / 10 » Learning a Subclass of Regular Patterns in Polynomial Time |
JALC
2007
14 years 11 months ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
105
click to vote
ISMB
1994
15 years 8 days ago
1994
We describe and demonstrate the effectiveness of a method of predicting protein secondary structures, sheet regions in particular, using a class of stochastic tree grammars as rep...
105
click to vote
JMLR
2010
14 years 5 months ago
2010
We present a polynomial update time algorithm for the inductive inference of a large class of context-free languages using the paradigm of positive data and a membership oracle. W...
198
click to vote
ICDE
2008
IEEE
16 years 9 days ago
2008
IEEE
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
136
click to vote
ICALP
2011
Springer
14 years 2 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...