✦ LIBER ✦

Controlling the data space of tree structured computations

✍ Scribed by I. Gottlieb; B. Obrenić

Book ID: 114273407
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 355 KB
Volume: 187
Category: Article
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00132-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The reconfigurable ring of processors: f

The reconfigurable ring of processors: fine-grain tree-structured computations

✍ Rosenberg, A.L.; Scarano, V.; Sitaraman, R.K. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 421 KB

On the Power of the Linear Array Archite

On the Power of the Linear Array Architecture for Performing Tree-Structured Computations

✍ K. Kalpakis; Y. Yesha 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 985 KB

Rule-driven processing of tree-structure

Rule-driven processing of tree-structured data using pointed trees

✍ Nikita Schmidt; Ahmed Patel 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 349 KB

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

Pattern conserving data structure and al

Pattern conserving data structure and algorithms for computations on dendritic trees

✍ W.P. Ireland 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Systolic tree implementation of data str

Systolic tree implementation of data structures

✍ Chang, J.H.; Ibarra, O.H.; Chung, M.J.; Rao, K.K. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 807 KB