Concept

Algorithme glouton

Publications associées (331)

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

Kernel Matching Pursuit for Large Datasets

Jean-Philippe Thiran, Vlad Popovici

Kernel matching pursuit is a greedy algorithm for building an approximation of a discriminant function as a linear combination of some basis functions selected from a kernel-induced dictionary. Here we propose a modification of the kernel matching pursuit ...

2005

Global mixed-integer dynamic optimization

Benoît Chachuat

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

2005

Media-Specific Rate Allocation in Multipath Networks

Pascal Frossard, Dan Jurca

We address the problem of joint path selection and rate allocation in multipath streaming in order to optimize a media specific quality of service. An optimization problem is proposed, which aims at minimizing a video distortion metric based on sequence-de ...

2005

A Comparison of Line Extraction Algorithms using 2D Laser Rangefinder for Indoor Mobile Robotics

Roland Siegwart, Nicola Tomatis

This paper presents an experimental evaluation of different line extraction algorithms on 2D laser scans for indoor environment. Six popular algorithms in mobile robotics and computer vision are selected and tested. Experiments are performed on 100 real da ...

2005

Efficient routing with small buffers in dense networks

Martin Vetterli, Guillermo Barrenetxea Kobas

The analysis and design of routing algorithms for finite buffer networks requires solving the associated queue network problem which is known to be hard. We propose alternative and more accurate approximation models to the usual Jackson’s Theorem that give ...

2005

Colorations Suboptimales

Daniela Bronner

Le but de ce projet est de continuer la recherche sur les colorations suboptimales (des colorations utilisant plus de chi de G couleurs). Parmi les problèmes ouverts fingure la conjecture 2 dans [Blöchliger, de Werra. On some properties of suboptimal color ...

2005

Progressive coding of 3D objects based on overcomplete decompositions

Pascal Frossard, Pierre Vandergheynst, Ivana Tosic

This paper presents a progressive coding scheme for 3D objects, based on an overcomplete decomposition of the 3D model on a sphere. Due to increased freedom in the bases construction, redundant expansions have shown interesting approximation properties in ...

2005

Dynamic and fault-tolerant cluster management

Recent decentralised event-based systems have focused on providing event delivery which scales with increasing number of processes. While the main focus of research has been on ensuring that processes maintain only a small amount of information on maintain ...

2005

Secure Route Discovery for QoS-Aware Routing in Ad Hoc Networks

Panagiotis Papadimitratos

We address the problem of securing the route discovery for Quality-of- Service (QoS)-aware routing in ad hoc networks. We provide a specification of secure route discovery for QoS-aware routing. We propose a reactive secure routing protocol, SRP-QoS, to de ...

2005

Progressive low bit rate coding of simple 3D objects with Matching Pursuit

Pascal Frossard, Pierre Vandergheynst, Ivana Tosic

This paper presents a low rate progressive 3D mesh compression scheme for simple genus-zero 3D objects. The proposed scheme is based on signal representation using redundant expansions. 3D model representation is constructed using a Matching Pursuit algori ...

2005