1082 search results - page 15 / 217 » Approximation Algorithms for Spreading Points |
177
Voted
ARITH
2009
IEEE
15 years 7 months ago
2009
IEEE
This paper deals with the design and implementation of low latency software for binary floating-point division with correct rounding to nearest. The approach we present here targe...
110
Voted
STACS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
129
Voted
ALGORITHMICA
2005
15 years 3 months ago
2005
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
117
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
173
Voted
IPCO
2001
15 years 5 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...