Sciweavers

5153 search results - page 92 / 1031
» Introduction to Randomized Algorithms
Sort
View
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
16 years 2 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
IJCNN
2007
IEEE
15 years 8 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
FSTTCS
2009
Springer
15 years 9 months ago
Randomness extractors -- applications and constructions
Randomness extractors are efficient algorithms which convert weak random sources into nearly perfect ones. While such purification of randomness was the original motivation for c...
Avi Wigderson
FPL
2005
Springer
113views Hardware» more  FPL 2005»
15 years 7 months ago
Ziggurat-based Hardware Gaussian Random Number Generator
An architecture and implementation of a high performance Gaussian random number generator (GRNG) is described. The GRNG uses the Ziggurat algorithm which divides the area under th...
Guanglie Zhang, Philip Heng Wai Leong, Dong-U Lee,...
125
Voted
CPC
2007
101views more  CPC 2007»
15 years 2 months ago
Colouring Random 4-Regular Graphs
We show that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. The proof uses an efficient algorithm which a.a.s. 3colours a random 4-regular ...
Lingsheng Shi, Nicholas C. Wormald