2899 search results - page 79 / 580 » Dynamic Trees in Practice |
119
Voted
SSPR
1998
Springer
15 years 7 months ago
1998
Springer
Properly addressing the discretization process of continuos valued features is an important problem during decision tree learning. This paper describes four multi-interval discreti...
141
Voted
MSV
2004
15 years 4 months ago
2004
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
121
Voted
RT
1997
Springer
15 years 6 months ago
1997
Springer
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
119
Voted
DOCENG
2006
ACM
15 years 8 months ago
2006
ACM
With the advent of XML we have seen a renewed interest in methods for computing the difference between trees. Methods that include heuristic elements play an important role in pr...
118
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...