Results 231 to 240 of about 2,861,627 (269)
Some of the next articles are maybe not open access.
Interpolation for data structures
Proceedings of the 14th ACM SIGSOFT international symposium on Foundations of software engineering, 2006Interpolation based automatic abstraction is a powerful and robust technique for the automated analysis of hardware and software systems. Its use has however been limited to control-dominated applications because of a lack of algorithms for computing interpolants for data structures used in software programs.
Deepak Kapur +2 more
openaire +1 more source
Communications of the ACM, 2011
Google's Web Tables and Deep Web Crawler identify and deliver this otherwise inaccessible resource directly to end users.
Michael J. Cafarella +2 more
openaire +1 more source
Google's Web Tables and Deep Web Crawler identify and deliver this otherwise inaccessible resource directly to end users.
Michael J. Cafarella +2 more
openaire +1 more source
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 +2 more
openaire +3 more sources
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 +2 more
openaire +3 more sources
Acta Mathematica Scientia, 1983
Abstract It is the main aim in this papar to establish isomorphic relation between an equibottom tree class and an integeral sequence, and to study emphatically the expanding process of a tree and the iterative algorithm on the tree data.
openaire +2 more sources
Abstract It is the main aim in this papar to establish isomorphic relation between an equibottom tree class and an integeral sequence, and to study emphatically the expanding process of a tree and the iterative algorithm on the tree data.
openaire +2 more sources
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016
Data structures are an important component of efficient and well-structured programs. In shared memory distributed computing, correct data structures are difficult to construct because concurrent accesses by different processes can conflict with one another. One simple approach is to use a global lock to restrict access to one process at a time.
Faith Ellen, Trevor Brown 0001
openaire +1 more source
Data structures are an important component of efficient and well-structured programs. In shared memory distributed computing, correct data structures are difficult to construct because concurrent accesses by different processes can conflict with one another. One simple approach is to use a global lock to restrict access to one process at a time.
Faith Ellen, Trevor Brown 0001
openaire +1 more source
1996
A functional data structure is a data structure that is suitable for implementation in a functional programming language, or for coding in an ordinary language like C or Java using a functional style. Functional data structures are closely related to persistent data structures and immutable data structures—in fact, the three terms are often used ...
openaire +1 more source
A functional data structure is a data structure that is suitable for implementation in a functional programming language, or for coding in an ordinary language like C or Java using a functional style. Functional data structures are closely related to persistent data structures and immutable data structures—in fact, the three terms are often used ...
openaire +1 more source
Software: Practice and Experience, 1981
AbstractWhile the control structures in recent programming languages are structured, the data structures are still primitive. This paper examines data structures and operations on them, and proposes some new features in programming languages. These new features are principally in the areas of data description and data usage.
Nazim H. Madhavji, I. R. Wilson
openaire +2 more sources
AbstractWhile the control structures in recent programming languages are structured, the data structures are still primitive. This paper examines data structures and operations on them, and proposes some new features in programming languages. These new features are principally in the areas of data description and data usage.
Nazim H. Madhavji, I. R. Wilson
openaire +2 more sources
Proceedings of the 17th ACM SIGPLAN International Symposium on Database Programming Languages, 2019
Functional (aka immutable) data structures are used extensively in data management systems. From distributed systems to data persistence, immutability makes complex programs significantly easier to reason about and implement. However, immutability also makes many runtime optimizations like tree rebalancing, or adaptive organizations, unreasonably ...
Darshana Balakrishnan +2 more
openaire +1 more source
Functional (aka immutable) data structures are used extensively in data management systems. From distributed systems to data persistence, immutability makes complex programs significantly easier to reason about and implement. However, immutability also makes many runtime optimizations like tree rebalancing, or adaptive organizations, unreasonably ...
Darshana Balakrishnan +2 more
openaire +1 more source
Computer Languages, 1978
The procedural approach to data structures used in the SL5 programming language is described. The SL5 procedure mechanism forms the basis for this approach to data structures by treating procedures and their activation records (environments) as data objects and by decomposing the traditionally atomic operation of procedure invocation into more ...
openaire +2 more sources
The procedural approach to data structures used in the SL5 programming language is described. The SL5 procedure mechanism forms the basis for this approach to data structures by treating procedures and their activation records (environments) as data objects and by decomposing the traditionally atomic operation of procedure invocation into more ...
openaire +2 more sources
ACM SIGGRAPH 2007 courses, 2007
An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Such techniques are known as spatial indexing methods.
openaire +1 more source
An overview is presented of the use of spatial data structures in spatial databases. The focus is on hierarchical data structures, including a number of variants of quadtrees, which sort the data with respect to the space occupied by it. Such techniques are known as spatial indexing methods.
openaire +1 more source