Search Sciweavers | Sciweavers

: We study a model of random uniform hypergraphs, where a random instance is obtained by adding random edges to a large hypergraph of a given density. The research on this model fo...

Benny Sudakov, Jan Vondrák

claim paper

Read More »

click to vote

EC
2007

167views ECommerce» more EC 2007»

Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime

13 years 6 months ago

Download hal.inria.fr

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...

Sylvain Gelly, Sylvie Ruette, Olivier Teytaud

claim paper

Read More »

click to vote

IDA
2007
Springer

168views Information Technology» more IDA 2007»

Combining Bagging and Random Subspaces to Create Better Ensembles

14 years 26 days ago

Download kt.ijs.si

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...

Pance Panov, Saso Dzeroski

claim paper

Read More »

click to vote

APPROX
2007
Springer

141views Algorithms» more APPROX 2007»

The Cover Time of Random Digraphs

14 years 27 days ago

Download www.dcs.kcl.ac.uk

We study the cover time of a random walk on the random digraph Dn,p when np =

Colin Cooper, Alan M. Frieze

claim paper