Publications associées à Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees

Less Conservatism, Stronger Robustness: Iterative Robust Gain-Scheduled Path Following Control of Autonomous Bus With Unstructured and Changing Dynamics

Denis Gillet, Man Shi, Jianwei Li

Path-following control is a critical technology for autonomous vehicles. However, time-varying parameters, parametric uncertainties, external disturbances, and complicated environments significantly challenge autonomous driving. We propose an iterative rob ...

Ieee-Inst Electrical Electronics Engineers Inc2024

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

London2023

Better 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 PUBLICATIONS2020

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

2020

Coordinate Difference Matrices

Martin Vetterli, Gilles Baechler, Miranda Krekovic, Golnooshsadat Elhami

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

SIAM PUBLICATIONS2020

Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case

Valentin Hartmann

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 HEIDELBERG2020

Shapes From Echoes: Uniqueness From Point-to-Plane Distance Matrices

Martin Vetterli, Ivan Dokmanic, Miranda Krekovic

We study the problem of localizing a configuration of points and planes from the collection of point-to-plane distances. This problem models simultaneous localization and mapping from acoustic echoes as well as the & x201C;structure from sound & x201D; app ...

2020

An 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

Denoising ECG Signal by CSTFM Algorithm: Monitoring During Motorbike and Car Races

Guglielmo Frigo

mHealth technology, by using habitual devices, i.e., smartphones, improves prevention, diagnosis, treatment, monitoring, and management of health. Monitoring heart profile during intense sports activities allows to diagnose pathologies, not identifiable wi ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

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.

Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees

Geometric Learning: Leveraging differential geometry for learning and control

Less Conservatism, Stronger Robustness: Iterative Robust Gain-Scheduled Path Following Control of Autonomous Bus With Unstructured and Changing Dynamics

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

UCLID-Net: Single View Reconstruction in Object Space

Coordinate Difference Matrices

Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case

Shapes From Echoes: Uniqueness From Point-to-Plane Distance Matrices

An Improved Analysis of Local Search for Max-Sum Diversification

Denoising ECG Signal by CSTFM Algorithm: Monitoring During Motorbike and Car Races

Graph Chatbot

Chattez avec Graph Search

Geometric Learning: Leveraging differential geometry for learning and control

UCLID-Net: Single View Reconstruction in Object Space

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms

Coordinate Difference Matrices

Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case

Denoising ECG Signal by CSTFM Algorithm: Monitoring During Motorbike and Car Races

Less Conservatism, Stronger Robustness: Iterative Robust Gain-Scheduled Path Following Control of Autonomous Bus With Unstructured and Changing Dynamics

An Improved Analysis of Local Search for Max-Sum Diversification