1200 search results - page 25 / 240 » Marked Ancestor Problems |
ICML
2000
IEEE
14 years 10 months ago
2000
IEEE
Although Bayesian model averaging is theoretically the optimal method for combining learned models, it has seen very little use in machine learning. In this paper we study its app...
ICALP
2004
Springer
14 years 3 months ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
IJCAI
2003
13 years 11 months ago
2003
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requir...
CCCG
1993
13 years 11 months ago
1993
Given three angles summing to 2, given n points in the plane and a tripartition k1 + k2 + k3 = n, we can tripartition the plane into three wedges of the given angles so that the ...
CCCG
2009
13 years 11 months ago
2009
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...