Concept

Unit sphere

Publications associées (27)

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

IEEE COMPUTER SOC2022

Realizing doubles: a conjugation zoo

Jérôme Scherer

Conjugation spaces are topological spaces equipped with an involution such that their fixed points have the same mod 2 cohomology (as a graded vector space, a ring and even an unstable algebra) but with all degrees divided by two, generalizing the classica ...

CAMBRIDGE UNIV PRESS2021

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

On the Volume of the John-Lowner Ellipsoid

Grigory Ivanov

We find an optimal upper bound on the volume of the John ellipsoid of a k-dimensional section of the n-dimensional cube, and an optimal lower bound on the volume of the Lowner ellipsoid of a projection of the n-dimensional cross-polytope onto a k-dimension ...

SPRINGER2020

Geometric ergodicity for some space-time max-stable Markov chains

Erwan Fabrice Koch

Max-stable processes are central models for spatial extremes. In this paper, we focus on some space-time max-stable models introduced in Embrechts et al. (2016). The processes considered induce discrete-time Markov chains taking values in the space of cont ...

ELSEVIER SCIENCE BV2019

Concentration compactness for critical radial wave maps

Joachim Krieger, Elisabetta Chiodaroli

We consider radially symmetric, energy critical wave maps from (1 + 2)-dimensional Minkowski space into the unit sphere

\mathbf{S}^m

, m≥1, and prove global regularity and scattering for classical smooth data of finite energy. In addition, we establish a ...

2018

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

Approximating Steiner trees and forests with minimum number of Steiner points

Nachshon Cohen

Let R be a finite set of terminals in a convex metric space (M, d). We give approximation algorithms for problems of finding a minimum size set S subset of M of additional points such that the unit-disc graph G[R boolean OR S] of R boolean OR S satisfies s ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2018

Scenario Reduction Revisited: Fundamental Limits and Guarantees

Daniel Kuhn, Napat Rujeerapaiboon, Kilian Schindler, Wolfram Wiesemann

The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete scenario reduction, ...

2018

DETERMINING POSITIONS OF TRANSDUCERS FOR RECEIVING AND/OR TRANSMITTING WAVE SIGNALS

Paul Hurley, Matthieu Martin Jean-André Simeoni, Nezihe Merve Gürel

The invention is notably directed to a method for determining positions {pi}i=1,..., N of transducers {Ai}i=1,..., N of an apparatus. The transducers are assumed to be configured for receiving wave signals from and/or transmitting wave signals to one or mo ...

2017

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

Concentration compactness for critical radial wave maps

Joachim Krieger, Elisabetta Chiodaroli

We consider radially symmetric, energy critical wave maps from (1 + 2)-dimensional Minkowski space into the unit sphere

\mathbf{S}^m

, m≥1, and prove global regularity and scattering for classical smooth data of finite energy. In addition, we establish a ...

2018