Results 341 to 350 of about 37,788,190 (381)

Hybrid structure: data structuring for data flow

Microprocessing and Microprogramming, 1989
Abstract The asynchronous nature of the data flow model of computations allows exploitation of maximum inherent parallelism in many application programs. However, before the data flow model of computations can become a viable alternative to the control flow model of computations, one has to find practical solutions to some major problems such as ...
Ali R. Hurson, B. Lee
openaire   +2 more sources

Efficient Data Structures and Algorithms for Cloud Computing Platforms

2024 4th International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE)
The extensive adoption of cloud computing platforms in storing and processing data have brought forth a new age of efficiency in the way data is stored, processed and managed, requiring new data structures and algorithms that aim to further improve ...
Anbarasu Aladiyan
semanticscholar   +1 more source

The structure of “data structures”

Proceedings of the ACM '81 conference on - ACM 81, 1981
A data structure is defined to be a 4-tuple D, F, S, A>. D and F are Domain and Function definitions which define the externally observable behavior; S and A are a Storage Structure and Algorithms which implement the functions. It is shown that this definition helps organize the field of data structures for presentation to students.
openaire   +2 more sources

Data structures and network algorithms

CBMS-NSF Regional Conference Series in Applied Mathematics, 1983
Foundations Disjoint Sets Heaps Search Trees Linking and Cutting Trees Minimum Spanning Trees Shortest Paths Network Flows Matchings.
R. Tarjan
semanticscholar   +1 more source

Reclaiming Memory for Lock-Free Data Structures: There has to be a Better Way

ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2015
Memory reclamation for sequential or lock-based data structures is typically easy. However, memory reclamation for lock-free data structures is a significant challenge. Automatic techniques such as garbage collection are inefficient or use locks, and non-
Trevor Brown
semanticscholar   +1 more source

Using Data Structures

1981
The Oxford English Dictionary defines the word “recursion” in the following way: RECURSION. [Now rare or obs. 1626]. A backward movement, return.
Chris Mellish, William F. Clocksin
openaire   +2 more sources

Dynamic Data Structures

1978
The types of variable in Pascal programs have been classified (in chapter 7) as unstructured and structured. The structured types have been further subdivided into elementary structured types and advanced structured types. The variables themselves may also be divided into two groups, depending on the manner of their creation.
A. M. Addyman, I. R. Wilson
openaire   +2 more sources

Structure in tRNA data

Biochimie, 1982
260 sequences of tRNA are compared, after their classification into six categories: prokaryotic (83 sequences) and eukaryotic (83 sequences) elongators, prokaryotic (10 sequences) and eukaryotic (11 sequences), initiators, lower eukaryotic mitochondrial tRNA (53 sequences) and archaebacterial tRNA (20 sequences).
Grosjean, Henri, Cedergren, Robert, McKay, Wendy   +2 more
openaire   +3 more sources

Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing

, 2014
A Versatile Framework for Handling Subdivided Geometric Objects Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing gathers important ideas related to combinatorial maps and explains how the maps are applied in ...

semanticscholar   +1 more source

Modeling Multilevel Data Structures

, 2002
data are becoming quite common in political science and provide numerous opportunities for theory testing and development. Unfortunately this type of data typically generates a number of statistical problems, of which clustering is particularly impor ...
M. Steenbergen, Bradford S. Jones
semanticscholar   +1 more source