Concept

Contrainte (mathématiques)

Publications associées (210)

Large occlusion completion using normal maps

Pascal Fua, Christoph Strecha, Engin Tola, Andrea Fossati

Dense disparity maps can be computed from wide-baseline stereo pairs but will inevitably contain large areas where the depth cannot be estimated accurately because the pixels are seen in one view only. A traditional approach to this problem is to introduce ...

2010

Robust Controller Design by Convex Optimization based on Finite Frequency Samples of Spectral Models

Alireza Karimi, Roland Longchamp, Gorka Galdos Sanz de Galdeano

Some frequency-domain controller design problems are solved using a finite number of frequency samples. Consequently, the performance and stability conditions are not guaranteed for the frequencies between the frequency samples. In this paper, all possible ...

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

Cost-Optimal Outsourcing of Applications into the Clouds

Immanuel Trummer

Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities for outsourcing part of the IT-stack to third parties in order to run their applications ...

2010

A numerical method for the optimal control of switched systems

Maryam Kamgarpour

Switched dynamical systems have shown great utility in modeling a variety of systems. Unfortunately, the determination of a numerical solution for the optimal control of such systems has proven difficult, since it demands optimal mode scheduling. Recently, ...

IEEE2010

Derivatives with respect to metrics and applications: subgradient marching algorithm

This paper introduces a subgradient descent algorithm to compute a Riemannian metric that minimizes an energy involving geodesic distances. The heart of the method is the Subgradient Marching Algorithm to compute the derivative of the geodesic distance wit ...

Springer-Verlag2010

Imitation learning of Globally Stable Non-Linear Point-to-Point Robot Motions using Nonlinear Programming

Aude Billard, Seyed Mohammad Khansari Zadeh

This paper presents a method to learn arbitrary discrete motions from a set of demonstrations. We model a motion as a nonlinear autonomous (i.e. time-invariant) dynamical system, and define the sufficient conditions to make such a system globally asymptoti ...

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

Least-Squares Minimization Under Constraints

Pascal Fua, Mathieu Salzmann, Raquel Urtasun, Aydin Varol

Unconstrained Least-Squares minimization is a well-studied problem. For example, the Levenberg-Marquardt is extremely effective and numerous implementations are readily available. These algorithms are, however, not designed to perform least-squares minimiz ...

EPFL2010

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

MUNCH - Automated Reasoner for Sets and Multisets

Viktor Kuncak, Ruzica Piskac

This system description provides an overview of the MUNCH reasoner for sets and multisets. MUNCH takes as the input a formula in a logic that supports expressions about sets, multisets, and integers. Constraints over collections and integers are connected ...

Springer2010

Constrained Output Path-Following for Nonlinear Systems Using Predictive Control

Timm Faulwasser

We address the problem of steering the output of a nonlinear system along a given parametrized reference path, taking input and state constraints into account. Such problems are known as output path-following problems, which typically arise in vehicle and ...

2010

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