Concept

Bounded set (topological vector space)

Related publications (64)

Spline Shape Processing

In this thesis, we present a novel generic and unifying framework for data-adaptive shape modeling. Our work is motivated by the raising need for powerful geometric modeling kernels that are required for shape characterization in biomedical imaging. The on ...

EPFL2017

Hypomonotonicity of the Normal Cone and Proximal Smoothness

Grigory Ivanov

We study the properties of the normal cone to a proximally smooth set. We give a complete characterization of a proximally smooth set through the monotonicity properties of its normal cone in an arbitrary uniformly convex and uniformly smooth Banach space. ...

Heldermann Verlag2017

Shape Projectors for Landmark-Based Spline Curves

Michaël Unser, Daniel Andreas Schmitter

We present a generic method to construct orthogonal projectors for two-dimensional landmark-based parametric spline curves. We construct vector spaces that define a geometric transformation (e.g., affine, similarity, and scaling) that is applied to a refer ...

2017

A Singular Elliptic System with Higher Order Terms of p-Laplacian Type

Linda Maria De Cave

We use variational techniques to prove existence and nonexistence results for the following singular elliptic system: {div(vertical bar del u vertical bar(p-2)del u) = theta z(q)/u(1-0), u > 0 in Omega is an element of W-0(,1p) (Omega), -div(vertical bar d ...

Walter De Gruyter Gmbh2016

Mumford-Shah and Potts Regularization for Manifold-Valued Data

Martin Kurt Storath

Mumford-Shah and Potts functionals are powerful variational models for regularization which are widely used in signal and image processing; typical applications are edge-preserving denoising and segmentation. Being both non-smooth and non-convex, they are ...

Springer2016

Converse Bounds for Noisy Group Testing with Arbitrary Measurement Matrices

Volkan Cevher, Jonathan Mark Scarlett

We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of noisy tests. While matching achievability and converse bounds are known in several cases of interest for i.i ...

Ieee2016

A New Converse Bound for Coded Caching

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory--rate tradeoff is char ...

2016

An Adaptive Sparse Grid Algorithm for Elliptic PDEs with Lognormal Diffusion Coefficient

Fabio Nobile, Lorenzo Tamellini, Francesco Tesei

In this work we build on the classical adaptive sparse grid algorithm (T. Gerstner and M. Griebel, Dimension-adaptive tensor-product quadrature), obtaining an enhanced version capable of using non-nested collocation points, and supporting quadrature and in ...

Springer2016

Locally differentially-private distribution estimation

Michael Christoph Gastpar, Adriano Pastore

We consider a setup in which confidential i.i.d. samples X1, ..., Xn from an unknown discrete distribution PX are passed through a discrete memoryless privatization channel (a.k.a. mechanism) which guarantees an epsilon-level of local differential privacy. ...

Ieee2016

Bifurcation at isolated singular points for a degenerate elliptic eigenvalue problem

Charles Stuart

We consider bifurcation from the line of trivial solutions for a nonlinear eigenvalue problem on a bounded open subset, Omega, of R-N with N >= 3, containing 0. The leading term is a degenerate elliptic operator of the form L(u) = del . A del u where A is ...

Pergamon-Elsevier Science Ltd2015

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.