Euclidean Matching Problems and the Metropolis Algorithm
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
In this work we explore possibilities for coding when information worlds have different (semantic) values. We introduce a loss function that expresses the overall performance of a coding scheme for discrete channels and exchange the usual goal of minimizin ...
In this paper we present analog current mode Euclidean distance calculation (EDC) block, which calculates the distance between two current vectors. The proposed circuit is an important part of the CMOS-implemented Kohonen’s neural network (KNN) designed fo ...
The mathematical facet of modern crystallography is essentially based on analytical geometry, linear algebra as well as group theory. This study endeavours to approach the geometry and symmetry of crystals using the tools furnished by differential geometry ...
Dispersal is often viewed as a process on which the landscape has little effect. This is particularly apparent in populations’ genetic and ecological studies, where isolation by distance is generally tested using a Euclidean distance between populations. H ...
We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metric, or more specifically Euclidean coordinates to infer network proximity. This is ...
Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range to each other have been extensively studied. This paper considers a variation in which a connection between two poi ...
The content of this thesis is two-fold. The first part takes the form of an essay while the second part presents a theoretical project for an architectural installation. Using these two modes as different ways to address similar issues, the present work pr ...
McGill University, Post-Graduate Masters (M.Arch) Theory of Architecture1999
This paper addresses the problem of determining the node locations in ad-hoc sensor networks when only connectivity information is available. In previous work, we showed that the localization algorithm MDS-MAP proposed by Y. Shang \textit{et al} is able to ...
We propose a method for the registration of MRI brain images with the physical space. Points on the patients scalp are acquired using a magnetic-field digitizer. The registration transform is the rigid transform that minimizes the mean square distance bet ...
Continuum percolation models in which pairs of points of a two-dimensional Poisson point process are connected if they are within some range to each other have been extensively studied. This paper considers a variation in which a connection between two poi ...
