Now showing items 280-299 of 559

    • Interaction paradigms for distributed object-oriented programming 

      Mohan, T S
      Current trends in large-scale distributed programming on a network of workstations are experiencing a paradigm shift into object-orientation. This is primarily driven by the need for modular, compact, portable and reusable ...
    • Intersection Graphs Of Boxes And Cubes 

      Francis, Mathew C (2011-01-25)
      A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such that for u,v V(G), (u,v) E(G) ƒ (u) ƒ (v) ≠ . Interval graphs are thus the intersection graphs ...
    • Investigations on CPI Centric Worst Case Execution Time Analysis 

      Ravindar, Archana (2018-03-19)
      Estimating program worst case execution time (WCET) is an important problem in the domain of real-time systems and embedded systems that are deadline-centric. If WCET of a program is found to exceed the deadline, it is ...
    • IO Pattern Aware Methods to Improve the Performance and Lifetime of NAND SSD 

      Arpith, K
      Modern SSDs can store multiple bits per transistor which enables it to have higher storage capacities. Low cost per bit of such SSDs has made it a commercial success. As of 2018, cells with an ability to store three bits ...
    • iSAN : An intelligent storage area network 

      Ganesh, N
      A storage area network (SAN) is a high-speed special-purpose network that interconnects data storage devices and storage-consumers. Present day SANs, based on Fibre Channel or iSCSI, share a common deficiency: Neither of ...
    • The Isoperimetric Problem On Trees And Bounded Tree Width Graphs 

      Bharadwaj, Subramanya B V (2010-08-26)
      In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G = (V,E) be a finite, simple and undirected graph. For let δ(S,G)= {(u,v) ε E : u ε S and v ε V – S }be the edge boundary ...
    • Kernel Methods Fast Algorithms and real life applications 

      Vishwanathan, S V N (Indian Institute of Science, 2005-02-08)
      Support Vector Machines (SVM) have recently gained prominence in the field of machine learning and pattern classification (Vapnik, 1995, Herbrich, 2002, Scholkopf and Smola, 2002). Classification is achieved by finding a ...
    • knowledge teaching : an alternative strategy for knowkedge-base development 

      Moshkenani, Mohsen Sadighi
      The development of knowledge-based systems relies heavily on the transfer of human expertise into a structured knowledge base - a process known as knowledge acquisition or knowledge elicitation. This process is widely ...
    • A Knowledge-Based Approach To Pattern Clustering 

      Shekar, B (Indian Institute of Science, 2005-03-11)
      The primary objective of this thesis is to develop a methodology for clustering of objects based on their functionality typified by the notion of concept. We begin by giving a formal definition of concept. By assigning a ...
    • Knowledge-based approach to pattern clustering. 

      Shekar, B
      The primary objective of this thesis is to develop a methodology for clustering of objects based on their functionality, typified by the notion of concept. We begin by giving a formal definition of concept. By assigning a ...
    • Knowledge-based mining of multi-database for associations 

      Ananthanarayana, V S
      Knowledge Discovery in Databases (KDD) uses knowledge engineering tools and database technology to extract hidden patterns from databases. Data mining is a step in the KDD process that finds useful patterns in the data. ...
    • Knowledge-based preanalysis for multilevel clustering 

      Suresh Babu, V S S
      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 ...
    • 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 ...
    • Language Support for Exploiting Software Structure Specifications 

      Kumar, Bharath M (Indian Institute of Science, 2005-02-16)
      Precise specification of the architecture and design of software is a good practice. Such specifications contain a lot of information about the software that can potentially be exploited by tools, to reduce redundancy ...
    • Language Support for Exploiting Software Structure Specifications  

      Kumar, Bharath M
      Precise specification of the architecture and design of software is a good practice. Such specifications contain a lot of information about the software that can potentially be exploited by tools to reduce redundancy in ...
    • Language Support For Testing CORBA Based Applications 

      Vardhan, K Ananda (Indian Institute of Science, 2005-12-07)
      Component Based Development has emerged as economical, reusable, scalable way of developing enterprise as well as embedded software applications. Testing distributed component based systems is difficult when third party ...
    • Large Data Clustering And Classification Schemes For Data Mining 

      Babu, T Ravindra (2009-03-20)
      Data Mining deals with extracting valid, novel, easily understood by humans, potentially useful and general abstractions from large data. A data is large when number of patterns, number of features per pattern or both are ...
    • Large Scale Graph Processing in a Distributed Environment 

      Upadhyay, Nitesh (2018-05-25)
      Graph algorithms are ubiquitously used across domains. They exhibit parallelism, which can be exploited on parallel architectures, such as multi-core processors and accelerators. However, real world graphs are massive in ...
    • Large Scale Implementation Of The Block Lanczos Algorithm 

      Srikanth, Cherukupally (2010-08-16)
      Large sparse matrices arise in many applications, especially in the major problems of Cryptography of factoring integers and computing discrete logarithms. We focus attention on such matrices called sieve matrices generated ...