5153 search results - page 10 / 1031 » Introduction to Randomized Algorithms |
121
click to vote
EC
2007
14 years 9 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
IDA
2007
Springer
15 years 3 months ago
2007
Springer
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =
ACL
2007
14 years 11 months ago
2007
This paper addresses the issue of text normalization, an important yet often overlooked problem in natural language processing. By text normalization, we mean converting ‘inform...
SODA
2012
ACM
13 years 2 days ago
2012
ACM
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...