133 search results - page 19 / 27 » On the distinct distances determined by a planar point set |
101
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We consider approximate nearest neighbor searching in metric spaces of constant doubling dimension. More formally, we are given a set S of n points and an error bound &g...
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Discrete input distributions are capacity-achieving for a variety of noise distributions whenever the input is subject to peak power or other bounding constraints. In this pape...
ALGOSENSORS
2010
Springer
14 years 10 months ago
2010
Springer
We present an approach for the localization of passive nodes in a communication network using ambient radio or sound signals. In our settings the communication nodes have unknown p...
124
click to vote
ISBRA
2009
Springer
15 years 6 months ago
2009
Springer
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology – to compare evolutiona...
TAMC
2007
Springer
15 years 5 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...