etd AT Indian Institute of Science: Recent submissions
Now showing items 501-520 of 7574
-
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 ... -
Design and implementation of a high speed interconnection network for ANUPAM
The basic hardware and software features of the ANUPAM system have been described in this chapter. Communication within and outside the clusters in ANUPAM are also described. The communication bandwidth within an ANUPAM ... -
Fractal encoding for inpainting and secure image sharing
Fractal Encoding for Inpainting and Secure Image Sharing This thesis is an investigation to explore two new applications of fractal encoding: 1) secure image sharing and 2) image inpainting. Fractal encoding is a lossy ... -
On the Eikonal equation and shape from shading
This thesis proposes and develops new techniques for the solution of the Shape from Shading (SFS) problem. For a homogeneous Lambertian surface, illuminated by a distant point light source in the direction (p, q, -1) ... -
Multi-scale approaches to signal deblurring and reconstruction from zero-crossings
This thesis addresses two inverse problems in computer vision: Solving a class of ill-posed convolution equations We analyze the problem of deblurring a Gaussian-blurred signal, which belongs to the class of ill-posed ... -
Enhanced neural networks architectures for pattern classification
The thesis deals with the problem of pattern classification for which new algorithms using three different neural network models have been proposed: (i) Recursive (ii) Feedforward; and (iii) Self-Organizing Networks. These ... -
Machine recognition of printed kannada text
Optical Character Recognition (OCR) provides a more efficient and faster solution for many real-world problems such as form readers for various application forms, bank cheque reading, and postal mail sorting. Manual operation ... -
Implementing a weak form of memory consistency on a tree-based system
In this thesis, we propose and implement a weak form of memory consistency, called the Release Consistency for the Tree structure (RCT) model. This model exploits the properties of a tree network to yield a programming ... -
Feature transformation for speaker identification
The gradual automation of services and transactions that previously required human handling has led to a growing interest in biometrics, which are unique measurable traits of a human being used for automatic identity ... -
A Stochastic dynamical system for edge detection
A new stochastic algorithm for edge detection has been presented. This algorithm is based on time-homogeneous Markov chains with the same kind of transition probabilities as in Monte Carlo algorithms and is inherently ... -
Codes over galois rings closed under certain monomials
The use of error-control coding in information transmission systems and data storage systems is increasing rapidly. The primary aim of coding theorists has been to find “good codes” with “reasonably simple” decoding methods. ... -
Pattern recognition techniques based on self-Organization and learning vector Quantization
Autom atic Recognition of Patterns (APR) by a machine is perhaps the most challenging problem in Artificial Intelligence. The leitmotiv for the design of such a machine comes from the human visual system which is endowed ... -
Machine recognition of printed odiya text
Automatic recognition of characters by a machine is one of the challenging problems in Artificial Intelligence. The motivation for the design of such a machine comes from the human visual system (HVS). HVS is endowed with ... -
Design and implementation of a fortran to occam parallelizing parallel translator
Dependence analysis, which is the most critical component of PPT, has been described in this chapter. In order to establish dependence relations between multiple occurrences of different types of variables such as ... -
Protocols for Highly available distributed call processing systems
In telecom applications, a key requirement of any call processing system is high availability; an order of “five nines” availability is needed. With the evolution of Next Generation Networks (NGN), the current trend in the ...