1060 search results - page 138 / 212 » On the Discovery of Random Trees |
165
click to vote
NIPS
2004
15 years 7 months ago
2004
Go is an ancient oriental game whose complexity has defeated attempts to automate it. We suggest using probability in a Bayesian sense to model the uncertainty arising from the va...
180
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
181
click to vote
JACM
2010
15 years 4 months ago
2010
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
218
click to vote
PR
2011
14 years 9 months ago
2011
In this paper, we describe an approach for the automatic medical annotation task of the 2008 CLEF cross-language image retrieval campaign (ImageCLEF). The data comprise 12076 full...
188
click to vote
ESEM
2007
ACM
15 years 10 months ago
2007
ACM
The goal of this paper is to improve the prediction performance of fault-prone module prediction models (fault-proneness models) by employing over/under sampling methods, which ar...