Now showing items 481-500 of 545

    • Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of Low-Correlation CDMA Sequences 

      Garg, Gagan (2011-01-25)
      In this thesis, we investigate in detail, certain important problems in cryptography and coding theory. In the first part of this thesis, we discuss the number field sieve and compare the two ways in which the sieving ...
    • Efficient Compilation Of Stream Programs Onto Multi-cores With Accelerators 

      Udupa, Abhishek (2010-12-30)
      Over the past two decades, microprocessor manufacturers have typically relied on wider issue widths and deeper pipelines to obtain performance improvements for single threaded applications. However, in the recent years, ...
    • Conflict-Tolerant Features 

      Gopinathan, Madhu (2010-12-07)
      Large, software intensive systems are typically developed using a feature oriented development paradigm in which feature specifications are derived from domain requirements and features are implemented to satisfy such ...
    • Boxicity, Cubicity And Vertex Cover 

      Shah, Chintan D (2010-09-28)
      The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding ...
    • 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 ...
    • Computational Protein Structure Analysis : Kernel And Spectral Methods 

      Bhattacharya, Sourangshu (2010-08-24)
      The focus of this thesis is to develop computational techniques for analysis of protein structures. We model protein structures as points in 3-dimensional space which in turn are modeled as weighted graphs. The problem of ...
    • Efficient Frequent Closed Itemset Algorithms With Applications To Stream Mining And Classification 

      Ranganath, B N (2010-08-24)
      Data mining is an area to find valid, novel, potentially useful, and ultimately understandable abstractions in a data. Frequent itemset mining is one of the important data mining approaches to find those abstractions 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 ...
    • Compiler Assisted Energy Management For Sensor Network Nodes 

      Jindal, Prachee (2010-08-16)
      Emerging low power, embedded, wireless sensor devices are useful for wide range of applications, yet have very limited processing storage and especially energy resources. Sensor networks have a wide variety of applications ...
    • Simulation Based Algorithms For Markov Decision Process And Stochastic Optimization 

      Abdulla, Mohammed Shahid (2010-08-06)
      In Chapter 2, we propose several two-timescale simulation-based actor-critic algorithms for solution of infinite horizon Markov Decision Processes (MDPs) with finite state-space under the average cost criterion. On the ...
    • Recovery From DoS Attacks In MIPv6 : Modelling And Validation 

      Kumar, Manish C (2010-07-26)
      Denial-of-Service (DoS) attacks form a very important category of security threats that are possible in MIPv6 (Mobile Internet Protocol version 6). This thesis proposes a scheme for participants (Mobile Node, Home Agent, ...
    • Using Explicit State Space Enumeration For Specification Based Regression Testing 

      Chakrabarti, Sujit Kumar (2010-07-08)
      Regression testing of an evolving software system may involve significant challenges. While, there would be a requirement of maximising the probability of finding out if the latest changes to the system has broken some ...
    • Learning Algorithms Using Chance-Constrained Programs 

      Jagarlapudi, Saketha Nath (2010-07-08)
      This thesis explores Chance-Constrained Programming (CCP) in the context of learning. It is shown that chance-constraint approaches lead to improved algorithms for three important learning problems — classification with ...
    • Compiler-Assisted Energy Optimization For Clustered VLIW Processors 

      Nagpal, Rahul (2010-04-13)
      Clustered architecture processors are preferred for embedded systems because centralized register file architectures scale poorly in terms of clock rate, chip area, and power consumption. Although clustering helps by ...
    • Semi-Supervised Classification Using Gaussian Processes 

      Patel, Amrish (2010-03-26)
      Gaussian Processes (GPs) are promising Bayesian methods for classification and regression problems. They have also been used for semi-supervised classification tasks. In this thesis, we propose new algorithms for solving ...
    • 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 ...
    • 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. ...
    • A Mechanism Design Approach To Resource Procurement In Computational Grids With Rational Resource Providers 

      Prakash, Hastagiri (2009-07-08)
      A computational grid is a hardware and software infrastructure that provides dependable, consistent, pervasive, and inexpensive access to high-end computational capabilities. In the presence of grid users who are autonomous, ...
    • Superscalar Processor Models Using Statistical Learning 

      Joseph, P J (2009-06-24)
      Processor architectures are becoming increasingly complex and hence architects have to evaluate a large design space consisting of several parameters, each with a number of potential settings. In order to assist in guiding ...
    • 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, ...