80 search results - page 7 / 16 » The geometry and dynamics of binary trees |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
112
click to vote
CP
2006
Springer
15 years 3 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
107
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
101
click to vote
SAC
2005
ACM
15 years 5 months ago
2005
ACM
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
145
click to vote
VISUALIZATION
1996
IEEE
15 years 3 months ago
1996
IEEE
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...