Publication

Quantitative Languages

Related publications (47)

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.

FASTER CADZOW DENOISING BASED ON PARTIAL EIGENVALUE DECOMPOSITION

Yann Barbotin

Certain aspects of the present disclosure relate to a method for speeding up the Cadzow iterative denoising algorithm as a part of the Finite Rate of Innovation (FRI) processing and for decreasing its computational complexity. ...

USPTO2010

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009

Antichains For The Automata-Based Approach To Model-Checking

Laurent Doyen

We propose and evaluate antichain algorithms to solve the universality and language inclusion problems for nondeterministic Buchi automata, and the emptiness problem for alternating Buchi automata. To obtain those algorithms, we establish the existence of ...

2009

Quantitative Languages

Laurent Doyen

Quantitative generalizations of classical languages, which assign to each word a real number instead of a boolean value, have applications in modeling resource-constrained computation. We use quantitative automata (finite automata with transition weights) ...

2008

Expressiveness and Closure Properties for Quantitative Languages

Laurent Doyen

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...

2008

Equivalence of labeled Markov chains

Laurent Doyen

We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observations has the same probability of occurrence in the two LMCs. We show that equ ...

2008

Asymmetric information embedding

Mohammad Amin Shokrollahi

In the Information Embedding Problem one is given a piece of data which can be altered only conditionally, for example only at certain places. One is then asked to embed an arbitrary message into the data by only applying admissible changes to the data. Th ...

Springer-Verlag2008

Integration of TDOA Features in Information Bottleneck Framework for Fast Speaker Diarization

Hervé Bourlard, Fabio Valente, Deepu Vijayasenan

In this paper we address the combination of multiple feature streams in a fast speaker diarization system for meeting recordings. Whenever Multiple Distant Microphones (MDM) are used, it is possible to estimate the Time Delay of Arrival (TDOA) for differen ...

IDIAP2008

Silence Models in Weighted Finite-State Transducers

Philip Neil Garner

We investigate the effects of different silence modelling strategies in Weighted Finite-State Transducers for Automatic Speech Recognition. We show that the choice of silence models, and the way they are included in the transducer, can have a significant e ...

2008

Silence Models in Weighted Finite-State Transducers

Philip Neil Garner

IDIAP2008

Probabilistic Weighted Automata

Laurent Doyen

Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages

L

that assign to each word

w

a real number

L(w)

. The value of an infinite word

w

is computed as the maximal value of al ...

2009