Concept

Recursively enumerable language

Related publications (17)

0/1 vertex and facet enumeration with BDDs

In polyhedral studies of 0/1 polytopes two prominent problems exist. One is the vertex enumeration problem: Given a system of inequalities, enumerate its feasible 0/1 points. Another one is the convex hull problem: Given a set of 0/1 points in dimension d, ...

2007

Electromagnetic modelling of planar circuits in bounded layered media

Pedro Crespo Valero

Printed circuits in bounded media encompass a wide range of practical structures such as discontinuities in waveguides, planar circuits embedded in shielded multilayered media or even two-dimensional printed periodic structures. The Electromagnetic (EM) mo ...

EPFL2007

From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata

Determinisation and complementation are foundational notions in computer science. When considering finite automata on finite words nondeterminisation and complementation are one and the same. Given a nondeterministic finite automaton there exists an expone ...

2005

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

The 3-regular nets with 4 and 6 vertices per unit cell

The 3-regular nets with 4 and 6 vertices per unit cell are enumerated. The large number of nets obtained (5 nets and 269 nets resp.) is in stark contrast to the relatively small number of nets which are of crystallographic interest. This subset of crystall ...

1997

Recursive linear estimation in Krein spaces. II. Applications

Ali H. Sayed

We show that several applications considered in the context of Hoo filtering and game theory, risk sensitive control and estimation, follow as special cases of the Krein space Kalman filter. We show that these problems can be cast into the problem of calcu ...

IEEE1993

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.