2018 search results - page 82 / 404 » Code Normal Forms |
INTERSPEECH
2010
14 years 9 months ago
2010
To achieve natural high quality synthesised speech in HMMbased speech synthesis, the effective modelling of complex acoustic and linguistic contexts is critical. Traditional appro...
116
click to vote
IEEECGIV
2009
IEEE
15 years 8 months ago
2009
IEEE
—With the fusion in the world of art and science, technology has made a dent in the course of art, and there is now a time and place for those actively interested in both the aca...
208
click to vote
PODS
2009
ACM
16 years 2 months ago
2009
ACM
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
130
click to vote
DLT
2006
15 years 3 months ago
2006
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
108
Voted
DAC
2003
ACM
16 years 3 months ago
2003
ACM
Procedures for Boolean satis ability most commonly work with Conjunctive Normal Form. Powerful SAT techniques based on implications and con icts can be retained when the usual CNF...