301 search results - page 25 / 61 » On the Optimality of Probability Estimation by Random Decisi... |
CIAC
1994
Springer
13 years 12 months ago
1994
Springer
We consider the problem of maintaining a binary search tree (BST) that minimizes the average access cost needed to satisfy randomly generated requests. We analyze scenarios in whi...
KDD
1998
ACM
14 years 3 days ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
WSC
2004
13 years 9 months ago
2004
We consider the problem of optimal allocation of computing budget to maximize the probability of correct selection in the ordinal optimization setting. This problem has been studi...
ANSS
2004
IEEE
13 years 11 months ago
2004
IEEE
The Random Early Detection (RED) scheme for congestion control in TCP is well known over a decade. Due to a number of control parameters in RED, it cannot make acceptable packet-d...
COCOON
2001
Springer
14 years 12 days ago
2001
Springer
: We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are conta...