Browsing Computer Science and Automation (CSA) by thesis submitted date"1987"
Now showing items 1-6 of 6
-
Algorithmic studies on graph domination -refinements and extensions
Given a graph G = (V, E), where V is a finite set of vertices and E is the set of edges, a set D ? V of vertices is a dominating set if every vertex in V ? D is adjacent to some vertex in D. The size of a minimum cardinality ... -
Application of finite graph models of context fue languages.
A finite graph model for a context?free language is proposed. The model is called an extended transition system; its nodes encode [pushdown automata state, top stack symbol] pairs and its arcs encode pushdown automaton ... -
Dependency-lattices, acyclic hypergraphs and relational database scheme design
Compared to other models of data, the relational model offers several advantages: Clear separation between logical organization and physical storage of data Ease of understanding the logical structure Use of high-level ... -
Fast primality testing algorithm study and implementation
In the previous chapters we discussed the details of some primality testing algorithms and the implementation of a fast deterministic primality testing algorithm. Our implementation consists of programs written in Pascal ... -
Hierarchical Data Structures for Pattern Recognition
(Indian Institute of Science, 2005-02-22)Pattern recognition is an important area with potential applications in computer vision, Speech understanding, knowledge engineering, bio-medical data classification, earth sciences, life sciences, economics, psychology, ... -
Petri net-based techniques for modelling analysis,and performance evalution
The primary objective of this Thesis is to develop Petri net-based techniques for the modelling, analysis, and performance evaluation of distributed processing systems. To illustrate these techniques, we focus on two ...