1159 search results - page 170 / 232 » Binary Decision Graphs |
STRINGOLOGY
2004
13 years 11 months ago
2004
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
UAI
2004
13 years 11 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
WSC
1998
13 years 11 months ago
1998
A critical issue in advanced technology product development is assessing economic feasibility based on the potential for commercial success. This is particularly difficult for an ...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The relationship between automata and logics has been investigated since the 1960s. In particular, it was shown how to determine, given an automaton, whether or not it is...
ETS
2010
IEEE
13 years 11 months ago
2010
IEEE
It was shown in the past that ATPG based on the Boolean Satisfiability problem is a beneficial complement to traditional ATPG techniques. Its advantages can be observed especially ...