Distributed Sensor Network Localization from Local Connectivity: Performance Analysis for the HOP-TERRAIN Algorithm

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.

The increase in wireless data traffic continues and is a product of several factors. First, new technologies and capabilities enable new use cases for which new products emerge. Then, with the growing user adoption over time, the data traffic is further in ...

The largest operating stellarator, Wendelstein 7-X, is of the quasi-isodynamic type. For this design to scale up to a fusion reactor, several criteria must be met, one of them being good fast ion confinement. The latter still has to be tested experimentall ...

We propose a structured prediction approach for robot imitation learning from demonstrations. Among various tools for robot imitation learning, supervised learning has been observed to have a prominent role. Structured prediction is a form of supervised le ...

Among our five senses, we rely mostly on audition and vision to perceive an environment. Our ears are able to detect stimuli from all directions, especially from obstructed and far-away objects. Even in smoke, harsh weather conditions, or at night â situ ...

Conjugation spaces are topological spaces equipped with an involution such that their fixed points have the same mod 2 cohomology (as a graded vector space, a ring and even an unstable algebra) but with all degrees divided by two, generalizing the classica ...

We address the problem of stably and efficiently training a deep neural network robust to adversarial perturbations bounded by an

l_1

norm. We demonstrate that achieving robustness against

l_1

-bounded perturbations is more challenging than in the

l_2

...

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

Tonality is one of the most central theoretical concepts for the analysis of Western classical music. This study presents a novel approach for the study of its historical development, exploring in particular the concept of mode. Based on a large dataset of ...

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

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

Popular clustering algorithms based on usual distance functions (e.g., the Euclidean distance) often suffer in high dimension, low sample size (HDLSS) situations, where concentration of pairwise distances and violation of neighborhood structure have advers ...

Methods of topological data analysis have been successfully applied in a wide range of fields to provide useful summaries of the structure of complex data sets in terms of topological descriptors, such as persistence diagrams. While there are many powerful ...

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

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

Distributed Sensor Network Localization from Local Connectivity: Performance Analysis for the HOP-TERRAIN Algorithm

Chattez avec Graph Search

Cellular Fronthauling for Data Capacity Increase in Underserved Spaces

Fast ion generation with ICRF waves and beams in the Wendelstein 7-X stellarator

A structured prediction approach for robot imitation learning

Blind as a bat: spatial perception without sight

Realizing doubles: a conjugation zoo

Towards Stable and Efficient Adversarial Training against $l_1$ Bounded Adversarial Attacks

Maximum Independent Set: Self-Training through Dynamic Programming

Exploring the foundations of tonality: statistical cognitive modeling of modes in the history of Western classical music

Coordinate Difference Matrices

UCLID-Net: Single View Reconstruction in Object Space

On Perfect Clustering of High Dimension, Low Sample Size Data

From Trees to Barcodes and Back Again: Theoretical and Statistical Perspectives

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

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