2252 search results - page 201 / 451 » Improving Random Forests |
129
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
118
Voted
CATS
2008
15 years 5 months ago
2008
Pollard's rho method is a randomized algorithm for computing discrete logarithms. It works by defining a pseudo-random sequence and then detecting a match in the sequence. Ma...
136
click to vote
TREC
2004
15 years 5 months ago
2004
Our participation in TREC 2004 aims to extend and improve the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) for the robust track. We experiment with...
132
click to vote
WSC
2000
15 years 5 months ago
2000
An efficient implementation of linear feedback shift register sequences with a given characteristic polynomial is obtained by a new method. It involves a polynomial linear congrue...
132
Voted
SODA
1994
ACM
15 years 5 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...