49 search results - page 9 / 10 » Randomized and Deterministic Algorithms for the Dimension of... |
141
click to vote
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
213
click to vote
SIAMJO
2011
14 years 8 months ago
2011
Suppose we are given a matrix that is formed by adding an unknown sparse matrix to an unknown low-rank matrix. Our goal is to decompose the given matrix into its sparse and low-ran...
145
Voted
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
We wish to increase the power of an arbitrary algorithm designed for non-degenerate input, by allowing it to execute on all inputs. We concentrate on in nitesimal symbolic perturba...
122
click to vote
ECML
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Motivated by the analogies to statistical physics, the deterministic annealing (DA) method has successfully been demonstrated in a variety of application. In this paper, ...
187
click to vote
COMPGEOM
1992
ACM
15 years 9 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...