Results 221 to 230 of about 429,086 (268)
Some of the next articles are maybe not open access.
The refined process structure tree
Data & Knowledge Engineering, 2008We consider workflow graphs as a model for the control flow of a business process model and study the problem of workflow graph parsing, i.e., finding the structure of a workflow graph. More precisely, we want to find a decomposition of a workflow graph into a hierarchy of sub-workflows that are subgraphs with a single entry and a single exit of ...
Jussi Vanhatalo +2 more
openaire +1 more source
IEEE Transactions on Computers, 1968
Abstract—A new class of modular networks, called "modular tree networks," is presented. In these circuits every input of the first-level gate is connected to the output of a different second-level unit, and, in general, every input of every ith-level unit is connected to the output of a different (i+1)th-level unit.
openaire +3 more sources
Abstract—A new class of modular networks, called "modular tree networks," is presented. In these circuits every input of the first-level gate is connected to the output of a different second-level unit, and, in general, every input of every ith-level unit is connected to the output of a different (i+1)th-level unit.
openaire +3 more sources
Proceedings of the 1st annual conference on Computer graphics and interactive techniques - SIGGRAPH '74, 1974
Many existing systems provide extensive facilities for entry and manipulation of text. Typical of these are QED (Bell Telephone), TECO (MIT), TVEDIT (Stanford), and E (Yale). Text entry, insertion, deletion, search, and display are all performed interactively with a small number of key strokes.
openaire +1 more source
Many existing systems provide extensive facilities for entry and manipulation of text. Typical of these are QED (Bell Telephone), TECO (MIT), TVEDIT (Stanford), and E (Yale). Text entry, insertion, deletion, search, and display are all performed interactively with a small number of key strokes.
openaire +1 more source
Communications of the ACM, 1972
With this note I hope to bridge the gap between the adherents of structured programming and the devotees of the unrestricted goto . I describe a style of programming which combines the advantages of structured programming with nearly all the power of the jump.
openaire +1 more source
With this note I hope to bridge the gap between the adherents of structured programming and the devotees of the unrestricted goto . I describe a style of programming which combines the advantages of structured programming with nearly all the power of the jump.
openaire +1 more source
Computer Science Education, 1993
During the past few years, the computer science community has become increasingly aware of the importance of using formal specifications for programs. As computer science faculty, we must meet the challenge of introducing into our curriculum the necessary mathematical tools so that our students will be able to write precise descriptions of abstract ...
openaire +1 more source
During the past few years, the computer science community has become increasingly aware of the importance of using formal specifications for programs. As computer science faculty, we must meet the challenge of introducing into our curriculum the necessary mathematical tools so that our students will be able to write precise descriptions of abstract ...
openaire +1 more source
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
The Multifractal Structure of Arterial Trees
Journal of Theoretical Biology, 2003Fractal properties of arterial trees are analysed using the cascade model of turbulence theory. It is shown that the branching process leads to a non-uniform structure at the micro-level meaning that blood supply to the tissue varies in space. From the model it is concluded that, depending on the branching parameter, vessels of a specific size ...
Grasman, J. +3 more
openaire +3 more sources
Tree-Structured Haar Transforms
Journal of Mathematical Imaging and Vision, 2002Classical Haar functions are defined by the dyadic splitting of the interval. In this paper, the authors generalize the idea to an arbitrary time and scale splitting. To a given binary tree is associated an orthogonal system of Haar-type functions, which are called tree-structured Haar functions (TSH).
Karen O. Egiazarian, Jaakko Astola
openaire +2 more sources
Axiomatising Tree-Interpretable Structures
Theory of Computing Systems, 2002This paper is a new contribution to the study of the algorithmic properties of infinite structures. The topic is motivated by several problems in various areas of computer science. The author extends the notion of a prefix-recognizable graph to general relational structures by introducing tree-interpretable structures.
openaire +2 more sources
Decoding Distributed Tree Structures
2015Encoding structural information in low-dimensional vectors is a recent trend in natural language processing that builds on distributed representations [14]. However, although the success in replacing structural information in final tasks, it is still unclear whether these distributed representations contain enough information on original structures. In
Lorenzo Ferrone +2 more
openaire +3 more sources