Sphere-of-Influence Graphs in Normed Spaces

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.

Regularization addresses the ill-posedness of the training problem in machine learning or the reconstruction of a signal from a limited number of measurements. The method is applicable whenever the problem is formulated as an optimization task. The standar ...

The objective of this series is to study metric geometric properties of disjoint unions of Cayley graphs of amenable groups by group properties of the Cayley accumulation points in the space of marked groups. In this Part II, we prove that a disjoint union ...

Adaptive isogeometric methods for the solution of partial diifferential equations rely on the construction of locally refinable spline spaces. A simple and efficient way to obtain these spaces is to apply the multi-level construction of hierarchical spline ...

Given any solutionuof the Euler equations which is assumed to have some regularity in space-in terms of Besov norms, natural in this context-we show by interpolation methods that it enjoys a corresponding regularity in time and that the associated pressure ...

In many problems such as phase retrieval, molecular biology, source localization, and sensor array calibration, one can measure vector differences between pairs of points and attempt to recover the position of these points; this class of problems is called ...

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. ...

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 ...

Today, institutionalised discourses surrounding heritage have social and physical impacts, with the potential to lead to a break between inhabitants' collective memory of popular neighbourhoods, and their transforming territories. In this context, the acti ...

We focus on the generalized-interpolation problem. There, one reconstructs continuous-domain signals that honor discrete data constraints. This problem is infinite-dimensional and ill-posed. We make it well-posed by imposing that the solution balances data ...

We consider sample path properties of the solution to the stochastic heat equation, in Rd or bounded domains of Rd, driven by a Levy space-time white noise. When viewed as a stochastic process in time with values in an infinite-dimensional space, the solut ...

Sphere-of-Influence Graphs in Normed Spaces

Chat with Graph Search

A Unifying Representer Theorem for Inverse Problems and Machine Learning

Group Approximation in Cayley Topology and Coarse Geometry, Part II: Fibred Coarse Embeddings

Isogeometric analysis with C1 hierarchical functions on planar two-patch geometries

Regularity results for rough solutions of the incompressible Euler equations via interpolation methods

Coordinate Difference Matrices

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

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

Collective Memory and Resistance: Visual explorations in the Historic Centre and Films of Mexico City

Continuous-Domain Signal Reconstruction Using L-p-Norm Regularization

Path properties of the solution to the stochastic heat equation with Levy noise