ALGORITHMICA
2010
13 years 4 months ago
2010
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
SMA
2010
ACM
13 years 4 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
ASIACRYPT
2008
Springer
13 years 6 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
SPDP
1990
IEEE
13 years 8 months ago
1990
IEEE
Abstract. This article presents a randomized algorithm for leader election which uses bidirectionality of an asynchronous ring to force a node to "commit" to a coin flip ...
ISAAC
1994
Springer
13 years 8 months ago
1994
Springer
In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processo...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
RANDOM
1999
Springer
13 years 8 months ago
1999
Springer
We present a randomized algorithm to nd a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an...
IPPS
1999
IEEE
13 years 8 months ago
1999
IEEE
Optimal randomized and deterministic algorithms have been given for k-k routing on two-dimensional nn meshes. The deterministic algorithm is based on "column-sort" and e...
FOCS
1999
IEEE
13 years 8 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
SPAA
2000
ACM
13 years 8 months ago
2000
ACM
We conduct an experimental analysis of a distributed, randomized algorithm for edge coloring graphs. The algorithm is extremely simple, yet, according to the probabilistic analysi...