English
Related papers

Related papers: Open Problem Statement: Minimal Distortion Embeddi…

200 papers

The geometric $\delta$-minimum spanning tree problem ($\delta$-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the tree has a degree which exceeds $\delta$, and the…

Computational Geometry · Computer Science 2019-01-28 Patrick J. Andersen , Charl J. Ras

Multimodal data is a precious asset enabling a variety of downstream tasks in machine learning. However, real-world data collected across different modalities is often not paired, which is a significant challenge to learn a joint…

Machine Learning · Computer Science 2025-08-11 Mustapha Bounoua , Giulio Franzese , Pietro Michiardi

In the point set embeddability problem, we are given a plane graph $G$ with $n$ vertices and a point set $S$ with $n$ points. Now the goal is to answer the question whether there exists a straight-line drawing of $G$ such that each vertex…

Computational Geometry · Computer Science 2020-05-13 Tanaeem M. Moosa , M. Sohel Rahman

In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…

Analysis of PDEs · Mathematics 2017-05-19 Camillo De Lellis , Jusuf Ramic

We prove that the isometric embedding of any metric of differentiability class C1 in E3 exists. We use simplified notation for the given metric, namely geodesic parameters, and level parameters for the embedded surface in E3. Central to our…

Differential Geometry · Mathematics 2022-10-07 Edgar Kann

We consider optimization problems involving the multiplication of variable matrices to be selected from a given family, which might be a discrete set, a continuous set or a combination of both. Such nonlinear, and possibly discrete,…

Optimization and Control · Mathematics 2021-03-12 Burak Kocuk

We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…

Soft Condensed Matter · Physics 2015-06-04 Carolyn L. Phillips , Joshua A. Anderson , Greg Huber , Sharon C. Glotzer

In this work, we consider a method of searching of the direction of a wireless network development (the places of new access points or base stations etc.) optimized with criteria of coverage of important territories and minimum cost of…

Networking and Internet Architecture · Computer Science 2012-09-03 Lev Kazakovtsev

We initiate the study of metric embeddings with \emph{outliers}. Given some metric space $(X,\rho)$ we wish to find a small set of outlier points $K \subset X$ and either an isometric or a low-distortion embedding of $(X\setminus K,\rho)$…

Data Structures and Algorithms · Computer Science 2015-08-17 Anastasios Sidiropoulos , Yusu Wang

These are notes from talks given at ICMS, Edinburgh, 4/2007 ("Geometry and Algorithms workshop") and at Bernoulli Center, Lausanne 5/2007 ("Limits of graphs in group theory and computer science"). We survey the following type of dichotomies…

Metric Geometry · Mathematics 2010-03-02 Manor Mendel

Diversity maximization is an important geometric optimization problem with many applications in recommender systems, machine learning or search engines among others. A typical diversification problem is as follows: Given a finite metric…

Discrete Mathematics · Computer Science 2018-09-26 Alfonso Cevallos , Friedrich Eisenbrand , Sarah Morell

Metric embeddings traditionally study how to map $n$ items to a target metric space such that distance lengths are not heavily distorted; but what if we only care to preserve the relative order of the distances (and not their length)? In…

Data Structures and Algorithms · Computer Science 2024-01-01 Vaggos Chatziafratis , Piotr Indyk

Metric embeddings into structured spaces, particularly hierarchically well-separated trees (HSTs), are a fundamental tool in the design of online algorithms. In the classical online embedding setting, points arrive sequentially and must be…

Data Structures and Algorithms · Computer Science 2026-05-13 Christian Coester , Yichen Huang

We investigate for which metric spaces the performance of distance labeling and of $\ell_\infty$-embeddings differ, and how significant can this difference be. Recall that a distance labeling is a distributed representation of distances in…

Data Structures and Algorithms · Computer Science 2023-09-21 Arnold Filtser , Lee-Ad Gottlieb , Robert Krauthgamer

A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…

Computational Geometry · Computer Science 2008-12-17 Maarten Loffler , Jeff M. Phillips

Manifold learning (ML) aims to seek low-dimensional embedding from high-dimensional data. The problem is challenging on real-world datasets, especially with under-sampling data, and we find that previous methods perform poorly in this case.…

Machine Learning · Computer Science 2022-07-27 Zelin Zang , Siyuan Li , Di Wu , Ge Wang , Lei Shang , Baigui Sun , Hao Li , Stan Z. Li

Algebraic statistics is concerned with the study of probabilistic models and techniques for statistical inference using methods from algebra and geometry. This article presents a list of open mathematical problems in this emerging field,…

Statistics Theory · Mathematics 2007-11-10 Bernd Sturmfels

We study irreducible specializations, in particular when group-preserving specializations may not exist. We obtain a criterion in terms of embedding problems. We include several applications to analogs of Schinzel's hypothesis H and to the…

Number Theory · Mathematics 2010-09-23 Lior Bary-Soroker

We consider vectorial problems in the calculus of variations with an additional pointwise constraint. Our admissible mappings ${\bf n}:\mathbb{R}^k\rightarrow \mathbb{R}^d$ satisfy ${\bf n}(x)\in M$, where $M$ is a manifold embedded in…

Analysis of PDEs · Mathematics 2014-11-14 S. J. Bedford

This paper focuses on the time-harmonic electromagnetic (EM) scattering problem in a general medium which may possess a nontrivial topological structure. We model this by an inhomogeneous and possibly anisotropic medium with embedded…

Analysis of PDEs · Mathematics 2024-08-14 Huaian Diao , Hongyu Liu , Qingle Meng , Li Wang