Computer Science and Automation (CSA): Recent submissions
Now showing items 81-100 of 531
-
Bimodal Projections Based Features for High Dimensional Pattern Classification
Classification tasks involving high-dimensional vectors are affected by the curse of dimensionality requiring large amount of training data. This is because a high dimensional space with a modest number of samples is ... -
Instruction scheduling for RISC processors
Instruction scheduling is the process of reordering instructions (whether assembly code or code in some other form) so as to make fuller use of the resources provided by the processor. In the case of RISC processors, ... -
Wavelets for volume graphics
In recent years, there has been a shift in the paradigm from surface-based graphics to volume graphics. Volume graphics uses a three-dimensional unit cube, known as a voxel, as its primitive, whereas surface-based graphics ... -
Counting number of points on elliptic curves over F2m fields : An implementation study
Hasse’s theorem states that:ifE {W g) Then |i| < 2y/q. This gives the bound on the number of points. In 1985, Schoof presented a polynomial time algorithm for computing The algorithm has running time of 0(log® q) bit ... -
Soundness and completeness results in partially-interpreted logics
Formulas in mathematical logic are syntactic expressions of uninterpreted symbols. The classical computational techniques of logic are oriented toward establishing the truth or falsehood of logic formulas in their uninterpreted ... -
Algorithms and lower bounds for graph connectivity and covering
Graph Connectivity is a well-studied problem, and its time complexity is well understood. However, its space complexity remains a mystery. Closely related to the space complexity of connectivity is the problem of derandomizing ... -
Extension of path probability method to approximate inference over time
There has been a tremendous growth in publicly available digital video footage over the past decade. This has necessitated the development of new techniques in computer vision geared towards efficient analysis, storage, ... -
Incremental techniques for code generation problems
Incremental compilation plays an important role in the functioning of integrated programming environments. The earlier phases of compilation like lexical analysis, parsing, semantic analysis, and dataflow analysis have ... -
Compiling for a dataflow runtime on distributed memory parallel architectures
Programming for parallel architectures that do not have a shared address space is tedious due to the need for explicit communication between memories of different compute devices. A heterogeneous system with CPUs and ... -
Optimal linear regular tree pattern matching using pushdown automata
Code generation is a difficult and complex phase of compiler writing. Most problems associated with the code generation phase are NP-complete; therefore, heuristics have been employed to solve them. Instruction selection ... -
Studies in Probabilistic Model-Building Evolutionary Algorithms
Evolutionary algorithms (EAs) are a family of metaheuristics inspired by Darwin's theory of evolution through natural selection. They maintain and evolve a population of candidate solutions through stochastic variation and ... -
Numerical integration of ordinary differential equation on multiprocessing systems
In this thesis, we explore how to solve Ordinary Differential Equations (ODEs) on parallel computers. A comprehensive study of the current state-of-the-art methods for both sequential and parallel integration of ODEs is ... -
Design of parallel algorithms for a multiple bus multiprocessor system
Matrix operations play a crucial role in scientific computations. This thesis presents the design and analysis of four parallel matrix computation algorithms specifically suited for a broadcast bus-based Multiple Bus ... -
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 ... -
Multiprocessing architectures for parallel hidden surface removal algorithms
Interactive computer graphics systems have become powerful tools for man-machine interaction, with wide-ranging applications. One particularly exciting and important area is the synthetic generation of realistic images of ... -
Parallel algorithms for compilation
This thesis discusses the design of parallel algorithms for the compilation process. The model of computation is an SIMD (Single Instruction, Multiple Data) computer with shared memory, where no read or write conflicts are ... -
New techniques for the analysis of two and three dimensional objects
The results of an investigation carried out on certain pattern recognition aspects of a class of two-dimensional line drawings and three-dimensional objects are reported in this thesis. The motivation for the proposed ... -
Performance evaluation of computer systems using discrete event simulation
Chapter II This chapter discusses the currently available modeling techniques and the studies conducted using these techniques. Chapter III It presents a performance evaluation of Batch and Time-sharing systems. The ... -
Design for complete testability and fault diagnosis of programmable logic arrays
The primary objective of this thesis is the formulation of a systematic procedure for the conversion of a Programmable Logic Array (PLA) having untestable faults into a corresponding completely testable PLA. In a completely ... -
Transputer-based parallel implementation of neural nets for a class of pattern recognition problems
Neural networks are systems that are made up of a number of computing elements connected to each other making use of some of the organizational principles that are thought to be used in the human brain. For a large array ...