To prove termination of Java Bytecode (JBC) automatically, we transform JBC to finite termination graphs which represent all possible runs of the program. Afterwards, the graph can...
Marc Brockschmidt, Carsten Otto, Christian von Ess...
There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termina...
The construction of an associative -product of traces from an earlier paper is revisited using projection representation of traces. Using projections instead of trace prefixes res...
In this paper we revisit some basic configuration choices of HMMbased speech synthesis, such as waveform sampling rate, auditory frequency warping scale and the logarithmic scali...
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...