3055 search results - page 25 / 611 » Randomized Search Trees |
ICDM
2005
IEEE
14 years 2 months ago
2005
IEEE
There has been increasing number of independently proposed randomization methods in different stages of decision tree construction to build multiple trees. Randomized decision tre...
ALT
2010
Springer
13 years 10 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
TCS
2010
13 years 3 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
—We investigate approximating joint distributions of random processes with causal dependence tree distributions. Such distributions are particularly useful in providing parsimoni...
TCS
2008
13 years 8 months ago
2008
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...