140 search results - page 10 / 28 » Interpretation and Transformation for Abstracting Conversati... |
175
click to vote
MVA
1990
15 years 7 months ago
1990
d at a high abstraction level, and consists in an expectation-driven search starting from symbolic object descriptions and using a version of a distributed blackboard system for re...
153
click to vote
IANDC
2000
15 years 5 months ago
2000
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
158
click to vote
APLAS
2007
ACM
15 years 10 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
146
click to vote
ENTCS
2007
15 years 5 months ago
2007
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
146
click to vote
TASLP
2008
15 years 5 months ago
2008
Abstract--This paper presents a technique to transform high-effort voices into breathy voices using adaptive pre-emphasis linear prediction (APLP). The primary benefit of this tech...