Publication
Euclidean Distance Matrix Completion for Ad-hoc Microphone Array Calibration
Related publications (39)
Geometric Learning: Leveraging differential geometry for learning and control
In this thesis, we concentrate on advancing high-level behavioral control policies for robotic systems within the framework of Dynamical Systems (DS). Throughout the course of this research, a unifying thread weaving through diverse fields emerges, and tha ...
EPFL2024Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment
Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên
The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...
London2023Relative, local and global dimension in complex networks
Dimension is a fundamental property of objects and the space in which they are embedded. Yet ideal notions of dimension, as in Euclidean spaces, do not always translate to physical spaces, which can be constrained by boundaries and distorted by inhomogenei ...
NATURE PORTFOLIO2022UCLID-Net: Single View Reconstruction in Object Space
Pascal Fua, Benoît Alain René Guillard, Edoardo Remelli
Most state-of-the-art deep geometric learning single-view reconstruction approaches rely on encoder-decoder architectures that output either shape parametrizations or implicit representations. However, these representations rarely preserve the Euclidean st ...
2020The compass in the eye: The "geometric mechanics" of Viviani at the bedside of the Brunelleschi dome
Simon François Dumas Primbault
During the 17th century, being an engineer at the Medici Court was a discipline at the intersection of mathematics, and the pictorial and mechanical arts. Born out of the heritage of Alberti, Vinci, and Vasari, the Accademia del disegno - founded on the th ...
ARMAND COLIN2020Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
Ola Nils Anders Svensson, Ashkan Norouzi Fard, Justin Dean Ward
Clustering is a classic topic in optimization with k-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best-known algorithm for k-means in Euclidean space with a provable guarantee is a simple local ...
SIAM PUBLICATIONS2020Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case
We consider the problem of finding an optimal transport plan between an absolutely continuous measure and a finitely supported measure of the same total mass when the transport cost is the unsquared Euclidean distance. We may think of this problem as close ...
SPRINGER HEIDELBERG2020MATHICSE Technical Report: Volumetric Untrimming: Precise decomposition of trimmed trivariates into tensor products
3D objects, modeled using Computer Aided Geometric Design (CAGD) tools, are traditionally represented using a boundary representation (B-rep), and typically use spline functions to parameterize these boundary surfaces. However, recent development in physic ...
MATHICSE2019Volumetric untrimming: Precise decomposition of trimmed trivariates into tensor products
3D objects, modeled using Computer Aided Geometric Design (CAGD) tools, are traditionally represented using a boundary representation (B-rep), and typically use spline functions to parameterize these boundary surfaces. However, recent development in physic ...
2019An Improved Analysis of Local Search for Max-Sum Diversification
Friedrich Eisenbrand, Rico Zenklusen, Alfonso Bolívar Cevallos Manzano
We present new techniques to analyze natural local search algorithms for several variants of the max-sum diversification problem which, in its most basic form, is as follows: given an n-point set X subset of R-d and an integer k, select k points in X so th ...
INFORMS2019