The lexico-smallest representation of convex polyhedra
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This paper introduces a novel method for data-driven robust control of nonlinear systems based on the Koopman operator, utilizing Integral Quadratic Constraints (IQCs). The Koopman operator theory facilitates the linear representation of nonlinear system d ...
The field of computational topology has developed many powerful tools to describe the shape of data, offering an alternative point of view from classical statistics. This results in a variety of complex structures that are not always directly amenable for ...
In this thesis, we study the stochastic heat equation (SHE) on bounded domains and on the whole Euclidean space Rd. We confirm the intuition that as the bounded domain increases to the whole space, both solutions become arbitrarily close to one another ...
To efficiently interact with the external world, the brain needs to represent the size of the involved body parts - body representations (BR) - and the space around the body in which the interactions with the environment take place - peripersonal space rep ...
For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity rc(X). This parameter was introduced by Kaibel & Weltge (2015) and captures the ...
Sequence modeling for signs and gestures is an open research problem. In thatdirection, there is a sustained effort towards modeling signs and gestures as a se-quence of subunits. In this paper, we develop a novel approach to infer movementsubunits in a da ...
We obtain quantitative bounds on the mixing properties of the Hamiltonian Monte Carlo (HMC) algorithm with target distribution in d-dimensional Euclidean space, showing that HMC mixes quickly whenever the target log-distribution is strongly concave and has ...
Characters do not convey meaning, but sequences of characters do. We propose an unsupervised distributional method to learn the abstract meaning-bearing units in a sequence of characters. Rather than segmenting the sequence, this model discovers continuous ...
We review the notion of a linearity-generating (LG) process introduced by Gabaix and relate LG processes to linear-rational (LR) models studied by Filipović et al. We show that every LR model can be represented as an LG process and vice versa. We find that ...
We present a general theory of Group equivariant Convolutional Neural Networks (G-CNNs) on homogeneous spaces such as Euclidean space and the sphere. Feature maps in these networks represent fields on a homogeneous base space, and layers are equivariant ma ...
