Sciweavers

3047 search results - page 48 / 610
» Randomized Parallel Selection
Sort
View
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 2 months ago
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
Abhimanyu Das, David Kempe
SPAA
2010
ACM
14 years 15 days ago
Multi-sided shared coins and randomized set-agreement
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...
Keren Censor Hillel
SPDP
1990
IEEE
13 years 11 months ago
Randomized fault-detecting leader election in a bi-directional ring
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 ...
N. R. Wagner
EPS
1998
Springer
13 years 12 months ago
Sex, Mate Selection, and Evolution
: Simulations of the evolution of populations of diploid organisms showed that mate selection strategies which selected for "good genes" and strategies based on assortati...
Klaus Jaffe
RSA
2011
85views more  RSA 2011»
13 years 2 months ago
Piercing random boxes
Abstract. Consider a set of n random axis parallel boxes in the unit hypercube in Rd , where d is fixed and n tends to infinity. We show that the minimum number of points one nee...
Linh V. Tran