Publications associées à Indoor localization method and system

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.

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

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

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Jian Li, Lingxiao Huang

We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...

IEEE COMPUTER SOC2018

Formal Analysis of Distance Bounding with Secure Hardware

Serge Vaudenay, Handan Kilinç Alper

A distance bounding (DB) protocol is a two-party authentication protocol between a prover and a verifier which is based on the distance between the prover and the verifier. It aims to defeat threats by malicious provers who try to convince that they are cl ...

2018

Omnidirectional bats, point-to-plane distances, and the price of uniqueness

Martin Vetterli, Ivan Dokmanic, Miranda Krekovic

We study simultaneous localization and mapping with a device that uses reflections to measure its distance from walls. Such a device can be realized acoustically with a synchronized collocated source and receiver; it behaves like a bat with no capacity for ...

Ieee2017

From Tarski's Plank Problem to Simultaneous Approximation

János Pach, Andrei Kupavskii

A slab (or plank) is the part of the d-dimensional Euclidean space that lies between two parallel hyperplanes. The distance between the these hyperplanes is called the width of the slab. It is conjectured that the members of any infinite family of slabs wi ...

Mathematical Assoc Amer2017

Approximation algorithms for geometric dispersion

Alfonso Bolívar Cevallos Manzano

The most basic form of the max-sum dispersion problem (MSD) is as follows: given n points in R^q and an integer k, select a set of k points such that the sum of the pairwise distances within the set is maximal. This is a prominent diversity problem, with w ...

EPFL2016

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Distinct Values Of Bilinear Forms On Algebraic Curves

Frank de Zeeuw, Adrian Claudiu Valculescu

Let B-M : C x C -> C be a bilinear form B-M(p, q) - p(T)Mq, with an invertible matrix M is an element of C-2x2. We prove that any finite set S contained in an irreducible algebraic curve C of degree d in C determines Omega(d)(vertical bar S vertical bar(4/ ...

Univ Calgary, Dept Math & Statistics2016

Indoor localization method and system

Graph Chatbot

Chattez avec Graph Search

Blind as a bat: spatial perception without sight

Coordinate Difference Matrices

An Improved Analysis of Local Search for Max-Sum Diversification

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Formal Analysis of Distance Bounding with Secure Hardware

Omnidirectional bats, point-to-plane distances, and the price of uniqueness

From Tarski's Plank Problem to Simultaneous Approximation

Approximation algorithms for geometric dispersion

Space lower bounds for low-stretch greedy embeddings

Distinct Values Of Bilinear Forms On Algebraic Curves

Coordinate Difference Matrices

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Approximation algorithms for geometric dispersion

Distinct Values Of Bilinear Forms On Algebraic Curves

Blind as a bat: spatial perception without sight

Formal Analysis of Distance Bounding with Secure Hardware

An Improved Analysis of Local Search for Max-Sum Diversification

Omnidirectional bats, point-to-plane distances, and the price of uniqueness

From Tarski's Plank Problem to Simultaneous Approximation

Space lower bounds for low-stretch greedy embeddings