Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Representable functor

Related publications (29)

Commuting Scales. Cartographie dynamique d'accessibilité temporelle

Boris Beaude, Luc Guillemot

Représenter l’espace sans en réduire la complexité est une préoccupation centrale du travail du cartographe. Commuting Scale tente de relever ce défi en proposant plusieurs manières de répondre cartographiquement à la même question: quel est l’espace des p ...

2012

The Leaf Space Of A Multiplicative Foliation

Madeleine Jotz

We show that if a smooth multiplicative subbundle S subset of T G on a groupoid G P is involutive and satisfies completeness conditions, then its leaf space G/S inherits a groupoid structure over the space of leaves of TP boolean AND S in P. As an applicat ...

Amer Inst Mathematical Sciences2012

Homotopic Descent over Monoidal Model Categories

The starting point for this project is the article of Kathryn Hess [11]. In this article, a homotopic version of monadic descent is developed. In the classical setting, one constructs a category D(𝕋) of coalgebras in the Eilenberg-Moore category of ...

EPFL2011

Chemistry and Biology of Natural Products : Applications in Cancer and Infectious Diseases

This thesis is divided in four independent parts related to four different research projects. Each chapter describes one of the multiple aspects covered by organic chemistry, such as the generation of functional interfaces, understanding of biological proc ...

EPFL2011

Every graph admits an unambiguous bold drawing

János Pach

Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a b ...

Springer-Verlag Berlin2011

On the scaling of polar codes: II. The behavior of un-polarized channels

Rüdiger Urbanke, Seyed Hamed Hassani

We provide upper and lower bounds on the escape rate of the Bhattacharyya process corresponding to polar codes where transmission takes place over the the binary erasure channel. More precisely, we bound the exponent of the number of sub-channels whose Bha ...

IEEE2010

A Tighter Analysis of Work Stealing

Nicolas Gabriel Gast

Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost for managing a single centralized list becomes prohibitive. The objective of this wor ...

Springer Berlin Heidelberg2010

A union of incoherent spaces model for classification

Pierre Vandergheynst, Karin Schnass

We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data is well represented by a dictionary of features. In order to ensure low miscla ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

METHOD FOR SEGMENTATION OF AN MRI IMAGE OF A TISSUE IN PRESENCE OF PARTIAL VOLUME EFFECTS AND COMPUTER PROGRAM IMPLEMENTING THE METHOD

Bénédicte Marie Maréchal

A method and computer program for segmentation of an MRI image of tissue in presence of partial volume effects, include storing the MRI image in K-space representation as raw dataset, reconstructing N images, each represented by N sets of voxels and N sets ...

2008

Related publications (29)

METHOD FOR SEGMENTATION OF AN MRI IMAGE OF A TISSUE IN PRESENCE OF PARTIAL VOLUME EFFECTS AND COMPUTER PROGRAM IMPLEMENTING THE METHOD

Bénédicte Marie Maréchal

2008