Sciweavers

1068 search results - page 71 / 214
» Extremely randomized trees
Sort
View
POPL
2003
ACM
14 years 10 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 8 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
SIGKDD
2010
128views more  SIGKDD 2010»
13 years 4 months ago
On cross-validation and stacking: building seemingly predictive models on random data
A number of times when using cross-validation (CV) while trying to do classification/probability estimation we have observed surprisingly low AUC's on real data with very few...
Claudia Perlich, Grzegorz Swirszcz
ICPR
2006
IEEE
14 years 11 months ago
3D Segmentation by Maximally Stable Volumes (MSVs)
This paper introduces an efficient 3D segmentation concept, which is based on extending the well-known Maximally Stable Extremal Region (MSER) detector to the third dimension. The...
Horst Bischof, Michael Donoser