6251 search results - page 239 / 1251 » Randomness, Computability, and Density |
166
click to vote
ISPDC
2008
IEEE
16 years 29 days ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
181
click to vote
AIMSA
2008
Springer
16 years 27 days ago
2008
Springer
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...
158
click to vote
SPAA
2005
ACM
16 years 3 days ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
161
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
193
click to vote
NIPS
2008
15 years 8 months ago
2008
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...