Space lower bounds for low-stretch greedy embeddings
Publications associées (93)
Graph Chatbot
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.
This paper addresses the application of missing data recovery via matrix completion for audio sensor networks. We propose a method based on Euclidean distance matrix completion for ad-hoc microphone array location calibration. This method can calibrate a f ...
This paper offers a methodological contribution for computing the distance between two empirical distributions in an Euclidean space of very large dimension. We propose to use decision trees instead of relying on standard quantification of the feature spac ...
In a dramatic crisis context, Lisbon reveals itself as an attractive and dynamic city of alternative bustling creativity. Trying to understand this paradox, I analyse two successful “alternative cultural spaces”: Lx Factory and Pensão Amor. Urban strategie ...
The canton of Valais can be considered, in many respects, as a synecdoche of the Swiss territory. Presenting many linguistic, cultural or economical polarities that extend over short distances, exacerbating the tension between the ecumene and the ereme, su ...
Some of the routing protocols used in telecommunication networks route traffic on a shortest path tree according to configurable integral link weights. One crucial issue for network operators is finding a weight function that ensures a stable routing: when ...
We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...
This paper addresses the application of missing data recovery via matrix completion for audio sensor networks. We propose a method based on Euclidean distance matrix completion for ad-hoc microphone array location calibration. This method can calibrate a f ...
This paper presents a new intrinsic calibration method that allows us to calibrate a generic single-view point camera just by waving it around. From the video sequence obtained while the camera undergoes random motion, we compute the pairwise time correlat ...
Visualization tools can facilitate access to complex spatial phenomenon. This access is what the application to be presented aims at. As a case study to such a complex phenomenon, the addressed question is that of the commuters' space of the Swiss federal ...
The aim of my presentation is to communicate results of an exploratory stage of my research. I will briefly cover the research design, followed by a summary of the understandings of space that I use to structure the presentation. Then I will discuss some r ...