✦ LIBER ✦

A data tree structure for a hierarchical structure processing

✍ Scribed by Ranjan B. Kini

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 762 KB
Volume: 26
Category: Article
ISSN: 0360-8352
DOI: 10.1016/0360-8352(94)90050-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hierarchical data structure for repres

A hierarchical data structure for representing assemblies: part 1

✍ Kunwoo Lee; David C. Gossard 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 348 KB

A Data Structure for Dynamically Maintai

A Data Structure for Dynamically Maintaining Rooted Trees

✍ Greg N. Frederickson 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 274 KB

The directed topology tree data structure is developed for maintaining binary trees dynamically. Each of a certain set of tree operations is shown to take Ž . Olog n time, where n is the number of vertices in the trees. The directed topology trees are used to implement link᎐cut trees and dynamic exp

An Efficient Method for Version Control

An Efficient Method for Version Control of a Tree Data Structure

✍ ESTHER JINEE CHOI; YONG RAE KWON 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB 👁 1 views

A new method for version controlling of a tree structure is presented. The key feature of the method is that the latest state of a tree is retained and other versions are constructed from it on request, and information on the change history of a node is maintaind in its parent node. Several algorith

Organizational structure of a complex da

Organizational structure of a complex data processing department

✍ Niv Ahituv; Michael Hadass 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 741 KB

The traditional organizational structures of D.P. departments do not generally suit modern requirements. A new structure is suggested, followed by a description of its functioning through a project dcvelopmcnt procedure. Conversion stages from a traditional structure to the suggested structure are d

A hierarchical decomposition for large-s

A hierarchical decomposition for large-scale optimal control problems with parallel processing structure

✍ Shi-Chung Chang; Tsu-Shuan Chang; Peter B. Luh 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 841 KB

A hierarchical, time decomposition and coordination scheme for long horizon optimal control problems is suitable for parallel processing and adds a new dimension to results on large-scale dynamic optimization.

Enhanced layered segment trees: a pragma

Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects

✍ Gopal Racherla; Sridhar Radhakrishnan; B.John Oommen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 112 KB

The data structure that is probably most used in the pattern recognition and image processing of geometric objects is the segment tree and its optimized variant, the "layered segment tree". In all the versions currently known, except the work of Vaishnavi and Wood described later, these data structu