Sciweavers

2252 search results - page 56 / 451
» Improving Random Forests
Sort
View
IPL
2002
119views more  IPL 2002»
13 years 7 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
WINE
2005
Springer
131views Economy» more  WINE 2005»
14 years 1 months ago
On the Competitive Ratio of the Random Sampling Auction
We give a simple analysis of the competitive ratio of the random sampling auction from [10]. The random sampling auction was first shown to be worst-case competitive in [9] (with ...
Uriel Feige, Abraham Flaxman, Jason D. Hartline, R...
DATE
1997
IEEE
75views Hardware» more  DATE 1997»
14 years 7 days ago
Random benchmark circuits with controlled attributes
Two major improvements, controlled fan-in and automated initial-circuit production, were made over the random generator of benchmark circuits presented at DAC'94. This is an ...
Kazuo Iwama, Kensuke Hino, Hiroyuki Kurokawa, Suna...
SODA
1997
ACM
115views Algorithms» more  SODA 1997»
13 years 9 months ago
Faster Construction of Planar Two-Centers
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
David Eppstein
ISSTA
2006
ACM
14 years 2 months ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit