Concept

Computation in the limit

Related publications (4)

A Decision Procedure for Regular Membership and Length Constraints over Unbounded Strings

We prove that the quantifier-free fragment of the theory of character strings with regular language membership constraints and linear integer constraints over string lengths is decidable. We do that by describing a sound, complete and terminating tableaux ...

Springer-Verlag Berlin2015

Digital model-making and the encoding of design intent

Nathaniel Zuelzke

Across many generations, including the digitally naïve and savvy, digital technologies introduce something other to the design process. This other quality ranges from inaccessibility to facile but opaque production of complexity, yet in all cases has obscu ...

EPFL2012

LP-TRAP: Linear predictive temporal patterns

Hynek Hermansky

Autoregressive modeling is applied for approximating the temporal evolution of spectral density in critical-band-sized sub-bands of a segment of speech signal. The generalized autocorrelation linear predictive technique allows for a compromise between fitt ...

IDIAP2004

LP-TRAP: Linear predictive temporal patterns

Hynek Hermansky

2004

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.