Search
Now showing items 61-70 of 189
Morse-Smale Complexes : Computation and Applications
(2018-01-30)
In recent decades, scientific data has become available in increasing sizes and
precision. Therefore techniques to analyze and summarize the ever increasing
datasets are of vital importance. A common form of scientific ...
Designing Energy-Aware Optimization Techniques through Program Behaviour Analysis
(2018-02-18)
Green computing techniques aim to reduce the power foot print of modern embedded devices with particular emphasis on processors, the power hot-spots of these devices. In this thesis we propose compiler-driven and profile-driven ...
Effective Automatic Computation Placement and Data Allocation for Parallelization of Regular Programs
(2018-02-15)
Scientific applications that operate on large data sets require huge amount of computation power and memory. These applications are typically run on High Performance Computing (HPC) systems that consist of multiple compute ...
On Learning k-Parities and the Complexity of k-Vector-SUM
(2018-02-06)
In this work, we study two problems: first is one of the central problem in learning theory of learning sparse parities and the other k-Vector-SUM is an extension of the not oriousk-SUM problem. We first consider the problem ...
Matching Domain Model with Source Code using Relationships
(2018-01-30)
We address the task of mapping a given domain model (e.g., an industry-standard reference model) for a given domain (e.g., ERP), with the source code of an independently developed application in the same domain. This has ...
Hitting Geometric Range Spaces using a Few Points
(2018-02-15)
A range space (P, S) consists of a set P of n elements and a collection S = {S1,...,Sm} of subsets of P , referred to as ranges. A hitting set for this range space refers to a subset H of P such that every Si in S contains ...
Variants and Generalization of Some Classical Problems in Combinatorial Geometry
(2018-02-18)
In this thesis we consider extensions and generalizations of some classical problems
in Combinatorial Geometry. Our work is an offshoot of four classical problems in
Combinatorial Geometry. A fundamental assumption in these ...
Bayes Optimal Feature Selection for Supervised Learning
(2018-02-18)
The problem of feature selection is critical in several areas of machine learning and data analysis such as, for example, cancer classification using gene expression data, text categorization, etc. In this work, we consider ...