Sciweavers

5153 search results - page 71 / 1031
» Introduction to Randomized Algorithms
Sort
View
VMV
2001
108views Visualization» more  VMV 2001»
14 years 11 months ago
A Theoretical Comparison of Monte Carlo Radiosity Algorithms
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
Philippe Bekaert, Hans-Peter Seidel
IDEAS
2007
IEEE
128views Database» more  IDEAS 2007»
15 years 4 months ago
Streaming Random Forests
Many recent applications deal with data streams, conceptually endless sequences of data records, often arriving at high flow rates. Standard data-mining techniques typically assu...
Hanady Abdulsalam, David B. Skillicorn, Patrick Ma...
FSE
2007
Springer
263views Cryptology» more  FSE 2007»
15 years 4 months ago
Bad and Good Ways of Post-processing Biased Physical Random Numbers
Algorithmic post-processing is used to overcome statistical deficiencies of physical random number generators. We show that the quasigroup based approach for post-processing rando...
Markus Dichtl
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
14 years 9 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
ISAAC
2009
Springer
150views Algorithms» more  ISAAC 2009»
15 years 4 months ago
Random Generation and Enumeration of Bipartite Permutation Graphs
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, R...