4095 search results - page 75 / 819 » How to test a tree |
RECOMB
2005
Springer
14 years 9 months ago
2005
Springer
This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficien...
IDEAS
2005
IEEE
14 years 2 months ago
2005
IEEE
The recent proliferation of XML-based standards and technologies for managing data on the Web demonstrates the need for effective and efficient management of treestructured data....
ISAAC
2005
Springer
14 years 2 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
PPDP
2001
Springer
14 years 1 months ago
2001
Springer
Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denotin...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
Physical processes are computations only when we use them to externalize thought. Entities provide nature with a way to preserve structure over time. We think in terms of entities ...