Publications associées à Partie bornée d'un espace vectoriel topologique

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.

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

Beyond Wiener's Lemma: Nuclear Convolution Algebras and the Inversion of Digital Filters

Michaël Unser, Julien René Pierre Fageot, John Paul Ward

A convolution algebra is a topological vector space X that is closed under the convolution operation. It is said to be inverse-closed if each element of X whose spectrum is bounded away from zero has a convolution inverse that is also part of the algebra. ...

SPRINGER BIRKHAUSER2019

The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement

Michael Christoph Gastpar, Pierre Victor Xavier Quinton, Saeid Sahraei

A new scheme for the problem of centralized coded caching with non-uniform demands is proposed. The distinguishing feature of the proposed placement strategy is that it admits equal sub-packetization for all files while allowing the users to allocate more ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Improving Spatial Data Processing by Clipping Minimum Bounding Boxes

Anastasia Ailamaki, Darius Sidlauskas, Eleni Tzirita Zacharatou

The majority of spatial processing techniques rely heavily on the idea of approximating each group of spatial objects by their minimum bounding box (MBB). As each MBB is compact to store (requiring only two multi-dimensional points) and intersection tests ...

IEEE2018

Existence of solutions to a non-variational singular elliptic system with unbounded weights

Linda Maria De Cave

In this paper we prove an existence result for the following singular elliptic system {z > 0 in Omega, z is an element of W-0(iota,p)(Omega) : -Delta(p)z = a(x)z(q-iota)u(theta) , u > 0 in Omega, u is an element of W-0(iota,p)(Omega) : -Delta(p)u = b(x)z(q ...

Wiley-V C H Verlag Gmbh2017

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

In this paper, we consider the problem of sequentially optimizing a black-box function

f

based on noisy samples and bandit feedback. We assume that

f

is smooth in the sense of having a bounded norm in some reproducing kernel Hilbert space (RKHS), yield ...

2017

Fixed Points For Bounded Orbits In Hilbert Spaces

Nicolas Monod, Maxime Gheysens

Consider the following property of a topological group G: every continuous affine G-action on a Hilbert space with a bounded orbit has a fixed point. We prove that this property characterizes amenability for locally compact a-compact groups (e.g., countabl ...

Elsevier2017

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

In this paper, we consider the problem of sequentially optimizing a black-box function

f

based on noisy samples and bandit feedback. We assume that

f

is smooth in the sense of having a bounded norm in some reproducing kernel Hilbert space (RKHS), yield ...

2017

Partie bornée d'un espace vectoriel topologique

Graph Chatbot

Chattez avec Graph Search

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

Concept Discovery for The Interpretation of Landscape Scenicness

Beyond Wiener's Lemma: Nuclear Convolution Algebras and the Inversion of Digital Filters

The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement

Improving Spatial Data Processing by Clipping Minimum Bounding Boxes

Existence of solutions to a non-variational singular elliptic system with unbounded weights

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

Fixed Points For Bounded Orbits In Hilbert Spaces

Improving Spatial Data Processing by Clipping Minimum Bounding Boxes

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

Existence of solutions to a non-variational singular elliptic system with unbounded weights

Concept Discovery for The Interpretation of Landscape Scenicness

Fixed Points For Bounded Orbits In Hilbert Spaces

The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement

Beyond Wiener's Lemma: Nuclear Convolution Algebras and the Inversion of Digital Filters

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization