272 search results - page 28 / 55 » Lazy tree splitting |
ICMLA
2008
13 years 9 months ago
2008
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the s...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
A data structure is presented for the Mergeable Dictionary abstract data type, which supports the following operations on a collection of disjoint sets of totally ordered data: Pr...
SMI
2005
IEEE
14 years 1 months ago
2005
IEEE
Complex implicit CSG models can be represented hierarchically as a tree of nodes (the BlobTree) . However, current methods cannot be used to visualize changes made to these models...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...