Publications associées à Clé de contrôle

Bit-flipping LDPC under noise conditions and its application to Physically Unclonable Functions

A low-density parity check (LDPC) circuit and its properties as a post-processor is proposed for physically unclonable functions (PUFs) applications. PUFs can be realized using process variations or signal noises in SRAM or other PUF circuits, whereas the ...

Ieee2016

A Generic Algorithm for Checking Exhaustivity of Pattern Matching

Fengyun Liu

Algebraic data types and pattern matching are key features of functional programming languages. Exhaustivity checking of pattern matching is a safety belt that defends against unmatched exceptions at runtime and boosts type safety. However, the presence of ...

Assoc Computing Machinery2016

Distributed, Modular HTL

The Hierarchical Timing Language (HTL) is a real-time coordination language for distributed control systems. HTL programs must be checked for well-formedness, race freedom, transmission safety (schedulability of inter-host communication), and time safety ( ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2009

On the Complexity of Recognizing Iterated Differences of Polyhedra

The iterated difference of polyhedra

V = P_1 \backslash ( P_2 \backslash (... P_k ) ... )

has been proposed independently in [Zwie-Aart-Wess92] and [Shon93] as a sufficient condition for

V

to be exactly computable by a two-layered neural network. An al ...

Springer-Verlag1997

On the Complexity of Recognizing Iterated Differences of Polyhedra

The iterated difference of polyhedra

V = P_1 \backslash ( P_2 \backslash (... P_k ) ... )

has been proposed independently in [Zwie-Aart-Wess92] and [Shon93] as a sufficient condition for

V

to be exactly computable by a two-layered neural network. An al ...

IDIAP1997

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 Complexity of Recognizing Iterated Differences of Polyhedra

The iterated difference of polyhedra

V = P_1 \backslash ( P_2 \backslash (... P_k ) ... )

has been proposed independently in [Zwie-Aart-Wess92] and [Shon93] as a sufficient condition for

V

to be exactly computable by a two-layered neural network. An al ...

IDIAP1997

On the Complexity of Recognizing Iterated Differences of Polyhedra

The iterated difference of polyhedra

V = P_1 \backslash ( P_2 \backslash (... P_k ) ... )

has been proposed independently in [Zwie-Aart-Wess92] and [Shon93] as a sufficient condition for

V

to be exactly computable by a two-layered neural network. An al ...

Springer-Verlag1997

Clé de contrôle

Bit-flipping LDPC under noise conditions and its application to Physically Unclonable Functions

A Generic Algorithm for Checking Exhaustivity of Pattern Matching

A generic algorithm for checking exhaustivity of pattern matching

Distributed, Modular HTL

On the Complexity of Recognizing Iterated Differences of Polyhedra

On the Complexity of Recognizing Iterated Differences of Polyhedra

Graph Chatbot

Chattez avec Graph Search

Distributed, Modular HTL

On the Complexity of Recognizing Iterated Differences of Polyhedra

A generic algorithm for checking exhaustivity of pattern matching

On the Complexity of Recognizing Iterated Differences of Polyhedra