1036 search results - page 39 / 208 » Algorithms for Learning Regular Expressions |
121
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the numb...
102
click to vote
CORR
2009
Springer
14 years 11 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
90
Voted
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
We show that the downward-closure of a Petri net language is effectively computable. This is mainly done by using the notions defined for showing decidability of the reachability...
141
click to vote
FOIKS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...
TNN
2008
15 years 1 months ago
2008
In classical training methods for node open fault, we need to consider many potential faulty networks. When the multinode fault situation is considered, the space of potential faul...