Euclidean distance versus travel time in business location: A probabilistic mixture of hurdle-Poisson models
Publications associées (42)
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.
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 ...
Addressing a global key sector area - the high technology manufacturing sector - we examine if there is truly a benefit of corporate social disclosure to the bottom line of organizations within this sector and if stakeholders should devote more attention t ...
Euclidean distance matrices (EDMs) are matrices of the squared distances between points. The definition is deceivingly simple; thanks to their many useful properties, they have found applications in psychometrics, crystallography, machine learning, wireles ...
2015
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 ...
The well-known "necklace splitting theorem" of Alon (1987) asserts that every k-colored necklace can be fairly split into q parts using at most t cuts, provided k(q - 1)
This paper addresses the problem of ad hoc microphone array calibration where only partial information about the distances between the microphones is available. We construct a matrix consisting of the pairwise distances and propose to estimate the missing ...
2015
, ,
An indoor localization method for estimating the location of nodes (n1, n2), at least one node (n1) being connected to at least another node (n2) by at least two different channels (ch1, ch1′), comprising the following steps: measuring a distance between t ...
Recent methods for localization of microphones in a microphone array exploit sound sources at a priori unknown locations. This is convenient for ad-hoc arrays, as it requires little additional infrastructure. We propose a flexible localization algorithm by ...
We consider the problem of ad~hoc microphone array calibration where the distance matrix consisted of all microphones pairwise distances have entries missing corresponding to distances greater than dmax. Furthermore, the known entries are noisy ...