Sciweavers

146 search results - page 4 / 30
» New Techniques for Regular Expression Searching
Sort
View
FOSSACS
2008
Springer
13 years 9 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 6 months ago
Yacc is dead
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
Matthew Might, David Darais
ESWS
2007
Springer
13 years 11 months ago
Towards Novel Techniques for Reasoning in Expressive Description Logics based on Binary Decision Diagrams
We propose to design and study new techniques for description logic (DL) reasoning based on a prominent data structure that has been applied very successfully in various domains in...
Uwe Keller
ICTAI
1996
IEEE
13 years 11 months ago
Forward-Tracking: A Technique for Searching Beyond Failure
In many applications, such as decision support, negotiation, planning, scheduling, etc., one needs to express requirements that can only be partially satisfied. In order to expres...
Elena Marchiori, Massimo Marchiori, Joost N. Kok
RECOMB
2007
Springer
14 years 8 months ago
Learning Gene Regulatory Networks via Globally Regularized Risk Minimization
Learning the structure of a gene regulatory network from time-series gene expression data is a significant challenge. Most approaches proposed in the literature to date attempt to ...
Yuhong Guo, Dale Schuurmans