• Labelled clustering and its applications 

  Sridhar, V

  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 

  Pal, Sudebkumar Prasant

  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 

  Suresh Babu, V S S

  Though I used Prolog, the Ray prototype knowledge system is not just a backward chaining system. Qualitative reasoning is modeled by a rule language with an interpreter for expressing outcomes in terms of values from ...

• Optimization techniques applied to the design of integrated rural energy centres 

  Chetty, K Mallikarjuna

  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 

  Narahari, Y

  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 ...

• Algorithmic studies on graph domination -refinements and extensions 

  Sastry, P Shanthi

  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 ...

• Fast primality testing algorithm study and implementation 

  Prasad, T V S R V

  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 ...

• An integrated relational database for computer-aided design applications 

  Shenoy, Sudhir R

  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 ...

• Plefka's mean-field theory and belief networks 

  Bhattacharyya, Chiranjib

  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 ...

• On algebraic and analytic properties of polynomials over finite fields 

  Gupta, Chetan

  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 

  Shailesh Sadashiv, Patil

  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 ...

• Simulation based methods for optimization 

  Mishra, Vivek Kumar

  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 ...

• Galois field Computations : Implementation of a Library and a study of the Discrete Logarithm Problem 

  Das, Abhijit

  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 

  Sarala, A

  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 

  Sasikumar, M

  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 ...

• Escape mechanism in bistable systems driven by strongly correlated noise 

  Venkatesh, T G

  This thesis focuses on the analysis of nonlinear dynamical systems influenced by colored noise, which appears in diverse fields such as physics, chemistry, natural sciences, and engineering. The core problem involves solving ...

• Studies on parsing, syntax directed translation and conditional grammars 

  Shyamasundar, R K

  No Abstract

• Signal Processing Algorithms for Next-Generation Wireless Systems: Reconfigurable Intelligent Surfaces and Integrated Sensing and Communications 

  Sankar, R S Prasobh

  Next-generation wireless systems aim to revolutionize communication by achieving data rates up to terabits per second while also supporting diverse applications such as autonomous mobility, industrial automation, and ...

• Secure Auctions with Rational Parties 

  Shankar, Girisha

  Sealed bid auctions are used to allocate a resource among a set of interested parties. Traditionally, auctions need the presence of a trusted auctioneer to whom the bidders provide their private bid values. Existence of ...

• Asynchronous distributed rate control algorithms for best-effort sessions in integrated services networks with minimum rate guarantees 

  Abraham, Santosh P

  Packet switching networks provide a best-effort transport service that is typically used by store-and-forward applications, such as email, file transfer, and web browsing. In an Integrated Services Packet Network, the ...

View more