96 search results - page 7 / 20 » Restructuring ordered binary trees |
ICRA
2006
IEEE
15 years 3 months ago
2006
IEEE
– This paper presents a method for designing classifier to automate an evaluation process of protein crystallization growth states. The classifier is designed by binary decision ...
FSTTCS
2001
Springer
15 years 2 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
COLING
1992
14 years 10 months ago
1992
: This paper describes a possibility of expressing ordering constraints among non-sister constituents in binary branching syntactic structures on a local basis, supported by viewin...
ALGORITHMICA
2005
14 years 9 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
VR
2007
IEEE
15 years 3 months ago
2007
IEEE
The simulation of fracture leads to collision-intensive situations that call for efficient collision detection algorithms and data structures. Bounding volume hierarchies (BVHs) ...