Browsing Division of Electrical, Electronics, and Computer Science (EECS) by thesis submitted date"1999"
Now showing items 1-20 of 26
-
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 ... -
A Caching And Streaming Framework For Multimedia
(2012-03-26) -
Competitive queueing models of serial order memory in speech and language
A recent focus in cognitive and brain sciences is to construct models for memory starting with assumptions that are neurophysiologically plausible. The behavior of the model should fit the empirical data. In this thesis, ... -
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 ... -
An Environment for Automatic Generation of Code Optimizers
(Indian Institute of Science, 2005-03-11)Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this ... -
Galois field Computations : Implementation of a Library and a study of the Discrete Logarithm Problem
Computation over finite fields (also called Galois fields) is an active area of research in number theory and algebra, and finds many applications in cryptography, error control coding, and combinatorial design. In this ... -
On Perception-Based Image Compression Schemes
(2012-03-26) -
On-Line tamil characater recognition using neural networks
In this thesis, we design a neural network-based online Tamil character recognition system. The thesis focuses on the following areas: Character representation, Neural network architecture, and Training algorithms for ... -
Optimal Scheduling For Balancing Queue Lengths
(2012-02-22) -
A Parallelizing Compiler for Fortran
(Indian Institute of Science, 2005-03-09)With the advent of Distributed Memory Machines (DMMs) numerous work have been undertaken to ease the work of a programmer these systems. Data parallel languages like Fortran D, Vienna Fortran, High Performance Fortran and ... -
Pattern representation and prototype selection for handwritten digit recognition
In this work, we present three independent ideas to increase the classification accuracy using the nearest neighbour classifier. These ideas are: (i) combination of decisions using different representation schemes, (ii) ... -
Performance evaluation of backbone technologies in distributed systems
The backbone of a distributed system is the interior-most part of the communication network which carries traffic generated from several sources. Applications such as accessing the Internet, multimedia, etc., demand a lot ...