402 search results - page 27 / 81 » Complexity of Decision Problems for Simple Regular Expressio... |
SETN
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Single classifiers, such as Neural Networks, Support Vector Machines, Decision Trees and other, can be used to perform classification of data for relatively simple proble...
HYBRID
2000
Springer
14 years 9 days ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...
ICFP
1999
ACM
14 years 1 months ago
1999
ACM
d Abstract) Assaf J. Kfoury∗ Boston University http://www.cs.bu.edu/˜kfoury Harry G. Mairson† Brandeis University http://www.cs.brandeis.edu/˜mairson Franklyn A. Turbak‡ We...
BMCBI
2006
13 years 8 months ago
2006
Background: It is one of the ultimate goals for modern biological research to fully elucidate the intricate interplays and the regulations of the molecular determinants that prope...
AI
2006
Springer
13 years 8 months ago
2006
Springer
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint type...