Computer Science and Automation (CSA): Recent submissions
Now showing items 21-40 of 531
-
Contributions to the development of computationally efficient clustering techniques
The concept of multilevel theory is applied in this thesis to reduce the computation and storage requirements of various existing clustering algorithms. At the first level, the data is divided arbitrarily into a number of ... -
New charactrisations and algorithmic studies on chordal graphs and k-trees
A wealth of literature on graph theory has appeared in the last few centuries. This is to a large extent due to the increase in the applications of graph theory to problems of practical interest. Graph theory is also closely ... -
Zero Knowledge Proofs: Succinct Verification, Distributed Proofs and Lookup Arguments
Zero-Knowledge Proofs (ZKPs) are fundamental cryptographic tools enabling a prover to convince a verifier about the knowledge of a secret witness related to a public statement, without revealing any information beyond the ... -
Secure Vickrey Auctions with Rational Parties
In this work, we construct a second price (Vickrey) auction protocol (SPA), which does not require any auctioneers and ensures total privacy in the presence of rational parties participating in the auction. In particular, ... -
Protecting Deep Learning Models on Cloud Platforms with Trusted Execution Environments
Deep learning is rapidly integrated into different applications, from medical imaging to financial products. Organisations are spending enormous financial resources to train deep learning models. Often, many organisations ... -
Labelled clustering and its applications
Clustering is a process of grouping a collection of objects. Clustering approaches can be broadly categorized into conventional and knowledge-based approaches. In a conventional approach, objects are typically represented ... -
Weak visibility and related problems on simple polygons
Visibility and shortest path problems are two important areas of research in computational geometry. In this thesis we study weak visibility and related problems on simple polygons and propose efficient algorithms. We study ... -
Knowledge-based preanalysis for multilevel clustering
Multilevel clustering offers the cluster analyst flexibility of choosing different algorithms at different levels with the possibility of reducing overall computational effort in comparison with the single-level application ... -
Optimization techniques applied to the design of integrated rural energy centres
A major part of the energy needs of rural India and many other developing countries is met by non-commercial sources of energy. Considerable amounts of human and animal energy are also being spent in an inefficient manner ... -
Petri net-based techniques for modelling analysis,and performance evalution
The primary objective of this Thesis is to develop Petri net-based techniques for the modelling, analysis, and performance evaluation of distributed processing systems. To illustrate these techniques, we focus on two ... -
An integrated relational database for computer-aided design applications
In view of the widespread use of Computer Aided Design (CAD) systems, the problem of storing data efficiently (in terms of memory requirements and the time required to access it) is of considerable importance. This thesis ... -
Fast primality testing algorithm study and implementation
In the previous chapters we discussed the details of some primality testing algorithms and the implementation of a fast deterministic primality testing algorithm. Our implementation consists of programs written in Pascal ... -
Algorithmic studies on graph domination -refinements and extensions
Given a graph G = (V, E), where V is a finite set of vertices and E is the set of edges, a set D ? V of vertices is a dominating set if every vertex in V ? D is adjacent to some vertex in D. The size of a minimum cardinality ... -
Simulation based methods for optimization
In many engineering problems, one is often interested in optimizing a parameterized performance objective. If the objective function is analytically known and its derivatives easily computable, then a number of methods ... -
On algebraic and analytic properties of polynomials over finite fields
In this work, we provide some new interesting results in the emerging theory of higher-order Fourier analysis. The goal of this theory is to understand the connection between the algebraic structure and analytic properties ... -
Efficient computations with special large sparse matrices
Large sparse matrices find many applications in cryptography. A large sparse matrix is a matrix of huge dimensions but the number of nonzero entries per row of the matrix is very small. Most of the times, it is possible ... -
Plefka's mean-field theory and belief networks
Mean-field theory is an interesting alternative to Markov Chain Monte Carlo techniques for probabilistic inference in graphical models. In this thesis, we study a powerful mean-field technique proposed by Plefka, in the ... -
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 ... -
Facets of some combinatorial polytopes
A proven approach for solving hard combinatorial optimization problems is via polyhedral methods applied to integer programming formulations. Efficient algorithms for such problems are often problem specific and exploit ... -
Framework for solving vehicle scheduling problems using AI techniques
Transportation resource scheduling problems are of high academic as well as practical value. These are primarily concerned with generation of movement schedules for a set of vehicles (tankers, aircraft, etc) to distribute ...