Sciweavers

133 search results - page 19 / 27
» On the distinct distances determined by a planar point set
Sort
View
ESA
2008
Springer
126views Algorithms» more  ESA 2008»
13 years 9 months ago
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
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...
Sunil Arya, David M. Mount, Antoine Vigneron, Jian...
ICC
2007
IEEE
150views Communications» more  ICC 2007»
14 years 2 months ago
Capacity-Achieving Discrete Signaling over Additive Noise Channels
— 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...
Anke Feiten, Rudolf Mathar
ALGOSENSORS
2010
Springer
13 years 6 months ago
Self-localization Based on Ambient Signals
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...
Thomas Janson, Christian Schindelhauer, Johannes W...
ISBRA
2009
Springer
14 years 2 months ago
Untangling Tanglegrams: Comparing Trees by Their Drawings
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...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...
TAMC
2007
Springer
14 years 1 months ago
On Deciding Deep Holes of Reed-Solomon Codes
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...
Qi Cheng, Elizabeth Murray