Euclidean distance versus travel time in business location: A probabilistic mixture of hurdle-Poisson models
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.
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 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 ...
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 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 ...
According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an epsilon-net of size O (1/epsilon log 1/epsilon). Using probabilistic techniques, Pach and Woeginger (1990) showed that there exist range space ...
Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011
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 ...
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 ...
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 ...
This paper investigates the relationship between the state and India's rural informal sector by focusing on the collective mobilizations of middle-sized agricultural producers in Western Uttar Pradesh. These cultivators are involved in an economic sector w ...
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 ...
