Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Paper
Equivalence of free boolean graphs can be decided probabilistically in polynomial time
Abstract
Natural graphical representations for Boolean functions, so-called free Boolean graphs, arise in the study of Ianov schemes. Fortune, Hopcroft and Schmidt have asked if an algorithm can decide covalence of these free Boolean graphs in poly- time. We show that random polynomial time will suffice.
Related
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Thomas R. Puzak, A. Hartstein, et al.
CF 2007