Publications associées à Automate fini non déterministe

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Jonathan Mark Scarlett

This paper studies the second-order coding rates for memoryless channels with a state sequence known non-causally at the encoder. In the case of finite alphabets, an achievability result is obtained using constant-composition random coding, and by using a ...

Institute of Electrical and Electronics Engineers2015

Measuring and Synthesizing Systems in Probabilistic Environments

Barbara Jobstmann, Rishabh Singh

The traditional synthesis question given a specification asks for the automatic construction of a system that satisfies the specification, whereas often there exists a preference order among the different systems that satisfy the given specification. Under ...

Assoc Computing Machinery2015

Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences

Jayakrishnan Unnikrishnan

Consider a finite set of sources, each producing independent identically distributed observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources ...

Institute of Electrical and Electronics Engineers2015

Formalization, Implementation, and Modeling of Institutional Controllers for Distributed Robotic Systems

Alcherio Martinoli, José Nuno Ferreira Maia Pereira

The work described is part of a long term program of introducing institutional robotics, a novel framework for the coordination of robot teams that stems from institutional economics concepts. Under the framework, institutions are cumulative sets of persis ...

Mit Press2014

Finite state encoders and decoders for vector signaling codes

Mohammad Amin Shokrollahi, Harm Cronie

In a chip-to-chip communication system and apparatus, a set of physical signals to be conveyed over a communication bus is provided, and mapped to a codeword of a vector signaling code using the physical signals and a state information, wherein a codeword ...

2014

Bilinear Generalized Approximate Message Passing—Part I: Derivation

Volkan Cevher

In this paper, we extend the generalized approximate message passing (G-AMP) approach, originally proposed for high-dimensional generalized-linear regression in the context of compressive sensing, to the generalized-bilinear case, which enables its applica ...

Institute of Electrical and Electronics Engineers2014

Bilinear Generalized Approximate Message Passing—Part II: Applications

Volkan Cevher

Ieee-Inst Electrical Electronics Engineers Inc2014

Finite-Length Scaling for Polar Codes

Rüdiger Urbanke, Seyed Hamed Hassani

Consider a binary-input memoryless output-symmetric channel W. Such a channel has a capacity, call it I (W), and for any R < I (W) and strictly positive constant P-e we know that we can construct a coding scheme that allows transmission at rate R with an e ...

Ieee-Inst Electrical Electronics Engineers Inc2014

For Coordination, State Component Transitions

Simon Bliudze, Anastasia Mavridou, Radoslaw Szymanek, Alina Zolotukhina

Coordinating component behaviour and, in particular, concurrent access to resources is among the key difficulties of building large concurrent systems. To address this, developers must be able to manipulate high-level concepts, such as Finite State Machine ...

2013

Automate fini non déterministe

Graph Chatbot

Chattez avec Graph Search

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Measuring and Synthesizing Systems in Probabilistic Environments

Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences

Formal verification of infinite-state BIP models

Formalization, Implementation, and Modeling of Institutional Controllers for Distributed Robotic Systems

Finite state encoders and decoders for vector signaling codes

Bilinear Generalized Approximate Message Passing—Part I: Derivation

Bilinear Generalized Approximate Message Passing—Part II: Applications

Finite-Length Scaling for Polar Codes

For Coordination, State Component Transitions

On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences

Measuring and Synthesizing Systems in Probabilistic Environments

For Coordination, State Component Transitions

Bilinear Generalized Approximate Message Passing—Part I: Derivation

Formal verification of infinite-state BIP models

Bilinear Generalized Approximate Message Passing—Part II: Applications

Finite state encoders and decoders for vector signaling codes

Finite-Length Scaling for Polar Codes

Formalization, Implementation, and Modeling of Institutional Controllers for Distributed Robotic Systems