Browsing Computer Science and Automation (CSA) by thesis submitted date"1996"
Now showing items 1-15 of 15
-
Algorithms And Models For Debugging Distributed Programs
(2012-05-04) -
Automatic Data Partitioning By Hierarchical Genetic Search
(Indian Institute of Science, 2005-12-07)The introduction of languages like High Performance Fortran (HPF) which allow the programmer to indicate how the arrays used in the program have to be distributed across the local memories of a multi-computer has not ... -
Experiments With Unix Process Schedulers
(2012-05-09) -
Learning Decentralized Goal-Based Vector Quantization
(2012-05-04) -
Learning subspace methods using weighted and multi-subspace representations
The learning subspace methods (LSMs) of classification are decision-theoretic pattern recognition methods where the primary model for a class is a linear subspace of the Euclidean pattern space. Classification is based on ... -
New algorithm for linear tree pattern matching
Tree pattern matching is foundational to a wide variety of applications in Computer Science. We consider the problem of linear tree pattern matching and adopt a technique used for parsing context-free languages for this ... -
A New Algorithm For Linear Tree Pattern Matching
(2012-05-03)