Publication

On the boundedness of n-folds with κ(X) = n - 1

Publications associées (188)

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

On Minimal Trajectories for Mobile Sampling of Bandlimited Fields

Martin Vetterli, Jayakrishnan Unnikrishnan

We study the design of sampling trajectories for stable sampling and the reconstruction of bandlimited spatial fields using mobile sensors. The spectrum is assumed to be a symmetric convex set. As a performance metric we use the path density of the set of ...

Elsevier2015

Image coding with incomplete transforms competition for HEVC

Anne-Flore Nicole Marie Perrin

Overcomplete transforms have received considerable attention over the past years. However, they often suffer from a complexity burden. In this paper, a low complexity approach is provided, where an orthonormal basis is complemented with a set of incomplete ...

2015

A Model Predictive Control scheme with Ultimate Bound for Economic Optimization

Colin Neil Jones, Andrea Alessandretti

This paper presents a Model Predictive Control (MPC) scheme for nonlinear continuous-time systems where an economic stage cost, which is not a measure of the distance to a desired set point, is combined with a classic stabilizing stage cost. The associated ...

2015

Diameter Graphs in R-4

Andrei Kupavskii

A diameter graph in is a graph whose set of vertices is a finite subset of and whose set of edges is formed by pairs of vertices that are at diameter apart. This paper is devoted to the study of different extremal properties of diameter graphs in and on a ...

Springer2014

Stability Results For The Volume Of Random Simplices

Gergely Ambrus

It is known that for a convex body K in R-d of volume one, the expected volume of random simplices in K is minimized if K is an ellipsoid, and for d = 2, maximized if K is a triangle. Here we provide corresponding stability estimates. ...

Johns Hopkins Univ Press2014

Stability of the Classifications of Returns to Scale in Data Envelopment Analysis: A Case Study of the Set of Public Postal Operators

Matthias Finger

A significant theme in data envelopment analysis (DEA) is the stability of returns to scale (RTS) classification of specific decision making unit (DMU) which is under observed production possibility set. In this study the observed DMUs are public postal op ...

Budapest Tech2014

Towards PLEs through Widget Spaces in Moodle

Denis Gillet, Evgeny Bogdanov

Bringing flexibility and extensibility into Learning Management Systems is crucial because it gives teachers and students a free choice of technologies and educational materials they want to use for their courses. This paper presents a solution by enabling ...

Comsis Consortium2014

A note on coloring line arrangements

János Pach, Rom Pinchasi

We show that the lines of every arrangement of n lines in the plane can be colored with O(root n/log n) colors such that no face of the arrangement is monochromatic. This improves a bound of Bose et al. by a circle minus(root/log n) factor. Any further imp ...

Electronic Journal Of Combinatorics2014

Laboratory as a Service (LaaS): a Model for Developing and Implementing Remote Laboratories as Modular Components

Denis Gillet, Christophe Salzmann, Mohamed Tawfik

This contribution introduces a novel model, Laboratory as a Service (LaaS), for developing remote laboratories as independent component modules and implementing them as a set of loosely-coupled services to be consumed with a high level of abstraction and v ...

IEEE2014

Constrained Reachability and Trajectory Generation for Flat Systems

Timm Faulwasser

We consider the problem of trajectory generation for constrained differentially flat systems. Based on the topological properties of the set of admissible steady state values of a flat output we derive conditions which allow for an a priori verification of ...

Pergamon-Elsevier Science Ltd2014