Concept

Liste de théorèmes du point fixe

Publications associées (181)

RRB-Trees: Efficient Immutable Vectors

Immutable vectors are a convenient data structure for functional programming and part of the standard library of modern languages like Clojure and Scala. The common implementation is based on wide trees with a fixed number of children per node, which allow ...

2011

The School Bus Problem on Trees

Laura Sanità, Adrian Aloysius Bock

The School Bus Problem is an NP-hard vehicle routing problem in which the goal is to route buses that transport children to a school such that for each child, the distance travelled on the bus does not exceed the shortest distance from the child's home to ...

Springer-Verlag Berlin2011

Enabling parametric feasibility analysis in real-time calculus driven performance evaluation

Alena Simalatsar

This paper advocates a rigorously formal and compositional style for obtaining key performance and/or interface metrics of systems with real-time constraints. We propose a hierarchical approach that couples the independent and different by nature framework ...

ACM2011

Mutation of the BAFF furin cleavage site impairs B-cell homeostasis and antibody responses

Friedrich Beermann

B-cell-activating factor of the TNF family (BAFF)/BLyS contributes to B-cell homeostasis and function in the periphery. BAFF is expressed as a membrane-bound protein or released by proteolytic cleavage, but the functional importance of this processing even ...

Wiley-Blackwell2011

In Vitro Investigation of the Cellular Toxicity of Boron Nitride Nanotubes

László Forró, Arnaud Magrez, Endre Horvath, Rita Smajda, Lenke Horváth, Beat Schwaller

Nanotubes present one of the most promising opportunities in nanotechnology with a plethora of applications in nanoelectronics, mechanical engineering, as well as in biomedical technology. Due to their structure and some physical properties, boron nitride ...

American Chemical Society2011

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

U(VI) reduction by spores of Clostridium acetobutylicum

Rizlan Bernier-Latmani, Elena Suvorova Buffat, Harish Veeramani, Elena Cristina Dalla Vecchia, Nicholas Wigginton

Vegetative cells of Clostridium acetobutylicum are known to reduce hexavalent uranium (U(VI)). We investigated the ability of spores of this organism to drive the same reaction. We found that spores were able to remove U(VI) from solution when H, was provi ...

Elsevier2010

Fast Space-Variant Elliptical Filtering Using Box Splines

Michaël Unser, Kunal Narayan Chaudhury

The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is possible to filter an image with a Gaussian-like elliptic window of varying siz ...

IEEE2010

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Martin Vetterli, Yue Lu, Mina Karzand

Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a well-known and influential demosaicking algorithm based on alternating projections (AP), proposed by Gunturk, Altunbasak and Mersereau in 2002. Since its p ...

Institute of Electrical and Electronics Engineers2010

Flow Control for Cost-Efficient Peer-to-Peer Streaming

Dan-Cristian Tomozei

In this paper we address the issue of network cost efficiency for live streaming peer-to-peer systems. We formalize this as an optimization problem, which features a generic cost function. The latter is appropriate to capture not only ISP-specific link wei ...

IEEE2010

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search