Sciweavers

328 search results - page 4 / 66
» Simple Termination Revisited
Sort
View
BIRTHDAY
2010
Springer
13 years 5 months ago
Termination Graphs for Java Bytecode
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...
WSDM
2010
ACM
259views Data Mining» more  WSDM 2010»
14 years 4 months ago
Revisiting Globally Sorted Indexes for Efficient Document Retrieval
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...
Fan Zhang, Shuming Shi, Hao Yan, Ji-Rong Wen
FUIN
2010
101views more  FUIN 2010»
13 years 4 months ago
Infinite Product of Traces Represented by Projections
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...
Roman R. Redziejowski
ICASSP
2010
IEEE
13 years 6 months ago
Simple methods for improving speaker-similarity of HMM-based speech synthesis
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...
Junichi Yamagishi, Simon King
DBPL
2007
Springer
103views Database» more  DBPL 2007»
13 years 11 months ago
Datalog Programs over Infinite Databases, Revisited
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...
Sara Cohen, Joseph Gil, Evelina Zarivach