Search
Now showing items 11-15 of 15
Conflict-Tolerant Features
(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 ...
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 ...
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 ...
Boxicity, Cubicity And Vertex Cover
(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
(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 ...