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.

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 ...

2005

Multiscale Image Segmentation Using Active Contours

Jean-Philippe Thiran, Xavier Bresson, Laura Ioana Gui

We propose a new approach for image segmentation at different scales of observation, based on a multiscale image decomposition and on the active contour segmentation model. The proposed method consists of two steps. Firstly, a representation of a given ima ...

2005

The Definition of Transitive Closure with OCL - Limitations and applications

The Object Constraint Language (OCL) is based on rst- order logic and set theory. As the most well-known application, OCL is used to formulate well-formedness rules in the UML metamodel. Here, the transitive closure of a relationship is de ned in terms of ...

2003

The Definition of Transitive Closure with OCL: Limitations and Applications

The Object Constraint Language (OCL) is based on first-order logic and set theory. As the most well-known application, OCL is used to formulate well-formedness rules in the UML metamodel. Here, the transitive closure of a relationship is defined in terms o ...

2003

Teaching Image-Processing Programming in Java

Michaël Unser, Daniel Sage

Image processing (IP) can be taught very effectively by complementing the basic lectures with computer laboratories where the participants can actively manipulate and process images. This offering can be made even more attractive by allowing the students t ...

IEEE2003

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

We determine the capacity of a particular large Gaussian relay network in the limit as the number of relays tends to infinity. The upper bounds follow from a cut-set argument, and the lower bound follows from an argument involving uncoded transmission. We ...

2002

A Nominal Theory of Objects with Dependent Types

Martin Odersky, Vincent Cremet, Matthias Zenger

We design and study newObj, a calculus and dependent type system forobjects and classes which can have types as members. Type members canbe aliases, abstract types, or new types. The type system can modelthe essential concepts of Java's inner classes as we ...

2002

Markovian Term Structure Models in Discrete Time

Damir Filipovic

In this article we discuss Markovian term structure models in discrete time and with continuous state space. More precisely we are concerned with the structural properties of such models if one has the Markov property for a part of the forward curve. We in ...

2002

A Nominal Theory of Objects with Dependent Types

Martin Odersky, Vincent Cremet, Matthias Zenger

We design and study newObj, a calculus and dependent type system for objects and classes which can have types as members. Type members can be aliases, abstract types, or new types. The type system can model the essential concepts of Java's inner classes as ...

2002

A Formal Foundation of the RM-ODP Conceptual Framework

Alain Wegmann, Andrey Naumenko

This paper presents an approach for formalizing the RM-ODP (Reference Model for Open Distributed Processing), an ISO and ITU standard. The goal of this formalization is to clarify the RM-ODP modeling framework to make it more accessible to modelers such as ...

2001