104 search results - page 11 / 21 » Tight Bounds for Point Recolouring |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
120
click to vote
COMPGEOM
1992
ACM
15 years 1 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
ICC
2007
IEEE
15 years 3 months ago
2007
IEEE
— We examine the Shannon limits of communication systems when the precision of the analog-to-digital conversion (ADC) at the receiver is constrained. ADC is costly and powerhungr...
WALCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Let A and B be two families of two-way infinite x-monotone curves, no three of which pass through the same point. Assume that every curve in A lies above every curve in B and that...