Concept

Constructive set theory

Related publications (76)

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.

Linear Cryptanalysis of Non Binary Ciphers (with an application to SAFER)

Serge Vaudenay, Thomas Baignères, Jacques Stern

In this paper we re-visit distinguishing attacks. We show how to generalize the notion of linear distinguisher to arbitrary sets. Our thesis is that our generalization is the most natural one. We compare it with the one by Granboulan et al. from FSE'06 by ...

Springer2007

Validation of Visual Contracts for Services

Alain Wegmann, Lam Son Lê, José Diego de la Cruz Garcia

Visual modeling languages have specialized diagrams to represent behavior and concepts. This diagram specialization has drawbacks like the dif-ficulty to represent the effects of actions. We claim that visual contracts can de-scribe actions in a more compl ...

2006

On Small Degree Extension Fields in Cryptology

Robert Granger

This thesis studies the implications of using public key cryptographic primitives that are based in, or map to, the multiplicative group of finite fields with small extension degree. A central observation is that the multiplicative group of extension field ...

PhD dissertation, University of Bristol, UK, February 20062006

A tighter Cut-Set bound for the multi-terminal erasure channel without side information

Ramin Khalili

In this paper our recent results in the capacity of single relay erasure channels are used to derive a new and tighter cut-set bound. We initially present a simple and intuitive approach to derive the classical cut-set bound in General Multi-Terminal Erasu ...

2006

Reasoning on Dynamically Built Reasoning Space with Ontology Modules

Several applications require reasoning over autonomously developed ontologies. Initially conceived to explicit the semantics of a certain domain, these ontologies become a powerful tool for supporting business interactions, once heterogeneities have been s ...

2005

The TopModL Initiative.

Frédéric Fondement

We believe that there is a very strong need for an environment to support research and experiments on model-driven engineering. Therefore we have started the TopModL project, an open-source initiative, with the goal of building a development community to p ...

2005

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

Institute of Electrical and Electronics Engineers2005

Simulation Study on Mechanical Stabilization of MEMS Stencils for Nanolithography

Jürgen Brugger, Marc Antonius Friedrich van den Boogaart

Nanostencilling (localized material deposition through ultra-miniature shadow-masks) is a promising patterning technique. Currently, the quality of pattern resolution suffers significantly due to mechanical instability of the stencil caused by the depositi ...

2005

Sparse Approximation by Linear Programming using an L1 Data-Fidelity Term

Pierre Vandergheynst, Lorenzo Granai

This paper studies the problem of sparse signal approximation over redundant dictionaries. Our attention is focused on the minimization of a cost function where the error is measured by using the L1 norm, giving thus less importance to outliers. We show a ...

IEEE2005

Sparse Approximation by Linear Programming: Measuring the Error with the $ell_1$ Norm

Pierre Vandergheynst, Lorenzo Granai

In this report we study the problem of sparse signal approximation over redundant dictionaries. We focus our attention on the minimization of a cost function where the error is measured using a l1 norm. We show a constructive equivalence between this minim ...

2005