Concept

Espace vectoriel topologique

Publications associées (172)

The Complexity Of Early Deciding Set Agreement

In the k-set agreement problem, each processor starts with a private input value and eventually decides on an output value. At most k distinct output values may be chosen, and every processor's output value must be one of the proposed values. We consider a ...

Society for Industrial and Applied Mathematics2011

The Momentum Map Representation of Images

Tudor Ratiu, François Gay-Balmaz, Martins Bruveris

This paper discusses the mathematical framework for designing methods of Large Deformation Diffeomorphic Matching (LDM) for image registration in computational anatomy. After reviewing the geometrical framework of LDM image registration methods, we prove a ...

Springer Verlag2011

Understanding and Tackling the Root Causes of Instability in Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

We investigate, both theoretically and experimentally, the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that imp ...

2011

Optimal Control Theory with Applications in Economics

Thomas Alois Weber

This book bridges optimal control theory and economics, discussing ordinary differential equations, optimal control, game theory, and mechanism design in one volume. Technically rigorous and largely self-contained, it provides an introduction to the use of ...

MIT Press2011

Localized Ion Implantation Through Micro/Nanostencil Masks

Jürgen Brugger, Luis Guillermo Villanueva Torrijo, Cristina Martin Olmos, Philippe Langlet, Oscar Vazquez Mena

A method is presented that allows the deﬁnition of micrometer- and submicrometer-sized implanted structures in silicon without using photoresist patterning. The process is based on the use of stencils as masks in a conventional ion implanter, and is tested ...

Institute of Electrical and Electronics Engineers2011

Compressed classification of observation sets with linear subspace embeddings

Pascal Frossard

We consider the problem of classification of a pattern from multiple compressed observations that are collected in a sensor network. In particular, we exploit the properties of random projections in generic sensor devices and we take some first steps in in ...

2011

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

Exponential Natural Evolution Strategies

Daniël Pieter Wierstra, Tom Schaul

The family of natural evolution strategies (NES) offers a principled approach to real-valued evolutionary optimization by following the natural gradient of the expected fitness. Like the well-known CMA-ES, the most competitive algorithm in the field, NES c ...

2010

"Compressed" Compressed Sensing

Michael Christoph Gastpar

The field of compressed sensing has shown that a sparse but otherwise arbitrary vector can be recovered exactly from a small number of randomly constructed linear projections (or samples). The question addressed in this paper is whether an even smaller num ...

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

The Roundtable: An Abstract Model of Conversation Dynamics

Massimo Mastrangeli

Is it possible to abstract a formal mechanism originating schisms and governing the size evolution of social conversations? In this work we propose a constructive solution to this problem: an abstract model of a generic N-party turn-taking conversation. Th ...

University of Surrey, Department of Sociology2010

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