Computer Science and Automation (CSA)
Recent Submissions
-
Studies in learning and representation in connectionist networks
This work deals with questions related to learning and representation in connectionist networks. The main issue taken up in learning is the convergence of local learning rules for feedforward networks. We ask the following ... -
Evolutionary design of plan based pattern recognition systems in complex domains
Many real-life Pattern Recognition (PR) problems do not fit into the classical PR paradigms. Such systems are currently being implemented using knowledge-based approaches. Designing such systems is an involved, evolutionary ... -
Referral reward embedded bi-phase information diffusion technique for social networks
Social networks provide an effective marketing platform to enhance the visibility of a business by reaching out to a wide base of potential customers cutting across gaps of geographic locations, age groups, and socio-economic ... -
Hadwiger number and the cartesian product operation on graphs
The Hadwiger number ?(G) of a graph G is defined as the largest integer n for which the complete graph on n nodes K? is a minor of G. Hadwiger conjectured that for any graph G, ?(G) ? ?(G), where ?(G) is the chromatic ... -
Towards complete automatic code generation
A compiler consists of two phases: source program analysis and object program synthesis. The problem of compilation has been tackled in depth, and many tools and techniques exist for building the analysis phase. Similar ... -
Effective optimization techniques for a parallel file system
Effective Optimization Techniques for a Parallel File System by Raghvendran M Significant work has been done in evolving parallel I/O architectures, I/O interfaces, and other programming techniques. However, only a few ... -
Formal tools for specification-driven protocol design of distributed computing systems
The widespread use of Distributed Computing Systems (DCSs) is due to the advantages of better performance, improved reliability, efficient resource sharing and easy upgradability. In order to realize the advantages of a ... -
LiWA : a lightweight agent framework for distributed systems
In the world of mobile computing, agent-based systems present one of the most promising areas of research in distributed systems. Component-based architecture is a new paradigm that is ideal for developing agent frameworks, ... -
Design and implementation of a multidimensional multilink multicomputer hardware and software
In this thesis, we propose and implement a multidimensional multilink system (MMS) architecture which uses message passing paradigm between computing elements (CEs). The merits of this architecture are its simplicity, regularity ... -
SAFIUS - A secure accountable filesystem over untrusted storage
With storage data requirements growing at around 40% every year, the entities that control the data are different from entities that consume the data. The drastic growth in storage requirements and the ubiquitous accessibility ... -
Bimodal Projections Based Features for High Dimensional Pattern Classification
Some classification techniques require class labels to be specified. One such technique is Fisher's Linear Discriminant (FLD), which has been used to develop an algorithm that seeks bimodal projection directions. Although ... -
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 ... -
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, ... -
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, ... -
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 ... -
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 ... -
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 ...
RSS 1.0