Browsing Computer Science and Automation (CSA) by thesis submitted date"2007"

Now showing items 1-11 of 11

    • Bounds On Augmented Automata And Quantum Adiabatic Optimization 

      Rao, M V Panduranga (2009-05-25)
      Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ...

    • Computational Problems In Codes On Graphs 

      Krishnan, K Murali (2009-05-11)
      Two standard graph representations for linear codes are the Tanner graph and the tailbiting trellis. Such graph representations allow the decoding problem for a code to be phrased as a computational problem on the corresponding ...

    • Design Of Incentive Compatible Mechanisms For Ticket Allocation In Software Maintenance Services 

      Subbian, Karthik (2009-05-28)
      Software Maintenance is becoming more and more challenging due to rapidly changing customer needs, technologies and need for highly skilled labor. Many problems that existed a decade ago continue to exist or have even ...

    • Efficient Kernel Methods For Large Scale Classification 

      Asharaf, S (2011-02-22)
      Classification algorithms have been widely used in many application domains. Most of these domains deal with massive collection of data and hence demand classification algorithms that scale well with the size of the data ...

    • Efficient Online Path Profiling 

      Vaswani, Kapil (2009-06-05)
      Most dynamic program analysis techniques such as profile-driven compiler optimizations, software testing and runtime property checking infer program properties by profiling one or more executions of a program. Unfortunately, ...

    • Experimental Studies On A New Class Of Combinatorial LDPC Codes 

      Dang, Rajdeep Singh (2009-06-05)
      We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on ...

    • Hadwiger's Conjecture On Circular Arc Graphs 

      Belkale, Naveen (2009-04-30)
      Conjectured in 1943, Hadwiger’s conjecture is one of the most challenging open problems in graph theory. Hadwiger’s conjecture states that if the chromatic number of a graph G is k, then G has a clique minor of size at ...

    • Optimizations In Storage Area Networks And Direct Attached Storage 

      Dharmadeep, M C (2009-07-23)
      The thesis consists of three parts. In the first part, we introduce the notion of device-cache-aware schedulers. Modern disk subsystems have many megabytes of memory for various purposes such as prefetching and caching. ...

    • Spill Code Minimization And Buffer And Code Size Aware Instruction Scheduling Techniques 

      Nagarakatte, Santosh G (2009-05-19)
      Instruction scheduling and Software pipelining are important compilation techniques which reorder instructions in a program to exploit instruction level parallelism. They are essential for enhancing instruction level ...

    • A Static Slicing Tool for Sequential Java Programs 

      Devaraj, Arvind (2018-07-28)
      A program slice consists of a subset of the statements of a program that can potentially affect values computed at some point of interest. Such a point of interest along with a set of variables is called a slicing criterion. ...

    • Time Management In Partitioned Systems 

      Kodancha, A Hariprasad (2010-02-11)
      Time management is one of the critical modules of safety-critical systems. Applications need strong assurance from the operating system that their hard real-time requirements are met. Partitioned system has recently evolved ...