2084 search results - page 185 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
154
Voted
SODA
2012
ACM
13 years 5 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
112
Voted
SIAMCO
2002
15 years 2 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
110
click to vote
SPAA
2010
ACM
15 years 7 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
96
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We define a novel, basic, unsupervised learning problem learning the the lowest density homogeneous hyperplane separator of an unknown probability distribution. This task...
113
Voted
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...