Search
Now showing items 161-170 of 203
Using Explicit State Space Enumeration For Specification Based Regression Testing
(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 ...
Time Management In Partitioned Systems
(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 ...
Learning Algorithms Using Chance-Constrained Programs
(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 ...
Semi-Supervised Classification Using Gaussian Processes
(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 ...
Efficient Compilation Of Stream Programs Onto Multi-cores With Accelerators
(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, ...
Efficient Kernel Methods For Large Scale Classification
(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 ...
Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of Low-Correlation CDMA Sequences
(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 ...
Intersection Graphs Of Boxes And Cubes
(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 ...
Online Optimization Of RED Routers
(2011-04-25)

