Browsing Computer Science and Automation (CSA) by Title
Now showing items 184203 of 362

Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework
(20090309)This thesis presents a new uniﬁed algorithm for cluster assignment and acyclic region scheduling in a partitioned architecture, and preliminary results on its integration into an experimental retargetable code generation ... 
Integrating ReadCopyUpdate Synchronization and Memory Allocation
The evolution of multicore systems with thousands of cores has led to the exploration of nontraditional procrastinationbased synchronization techniques such as ReadCopy Update (RCU). Deferred destruction is the ... 
Interactive Virtual Machining : A Voxel Based Approach
(20130724) 
Intersection Graphs Of Boxes And Cubes
(20110125)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 ... 
Investigations on CPI Centric Worst Case Execution Time Analysis
(20180319)Estimating program worst case execution time (WCET) is an important problem in the domain of realtime systems and embedded systems that are deadlinecentric. If WCET of a program is found to exceed the deadline, it is ... 
IO Pattern Aware Methods to Improve the Performance and Lifetime of NAND SSD
Modern SSDs can store multiple bits per transistor which enables it to have higher storage capacities. Low cost per bit of such SSDs has made it a commercial success. As of 2018, cells with an ability to store three bits ... 
The Isoperimetric Problem On Trees And Bounded Tree Width Graphs
(20100826)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 ... 
Kernel Methods Fast Algorithms and real life applications
(Indian Institute of Science, 20050208)Support Vector Machines (SVM) have recently gained prominence in the field of machine learning and pattern classification (Vapnik, 1995, Herbrich, 2002, Scholkopf and Smola, 2002). Classification is achieved by finding a ... 
A KnowledgeBased Approach To Pattern Clustering
(Indian Institute of Science, 20050311)The primary objective of this thesis is to develop a methodology for clustering of objects based on their functionality typified by the notion of concept. We begin by giving a formal definition of concept. By assigning a ... 
Language Support for Exploiting Software Structure Specifications
(Indian Institute of Science, 20050216)Precise specification of the architecture and design of software is a good practice. Such specifications contain a lot of information about the software that can potentially be exploited by tools, to reduce redundancy ... 
Language Support For Testing CORBA Based Applications
(Indian Institute of Science, 20051207)Component Based Development has emerged as economical, reusable, scalable way of developing enterprise as well as embedded software applications. Testing distributed component based systems is difficult when third party ... 
Large Data Clustering And Classification Schemes For Data Mining
(20090320)Data Mining deals with extracting valid, novel, easily understood by humans, potentially useful and general abstractions from large data. A data is large when number of patterns, number of features per pattern or both are ... 
Large Scale Graph Processing in a Distributed Environment
(20180525)Graph algorithms are ubiquitously used across domains. They exhibit parallelism, which can be exploited on parallel architectures, such as multicore processors and accelerators. However, real world graphs are massive in ... 
Large Scale Implementation Of The Block Lanczos Algorithm
(20100816)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 ... 
Learning Algorithms Using ChanceConstrained Programs
(20100708)This thesis explores ChanceConstrained Programming (CCP) in the context of learning. It is shown that chanceconstraint approaches lead to improved algorithms for three important learning problems — classification with ... 
Learning Decentralized GoalBased Vector Quantization
(20120504) 
Learning Dynamic Prices In Electronic Markets
(20110419) 
Learning Invariants for Verification of Programs and Control Systems
Deductive verification techniques in the style of Floyd and Hoare have the potential to give us concise, compositional, and scalable proofs of the correctness of various kinds of software systems like programs and control ... 
Learning Robust Support Vector Machine Classifiers With Uncertain Observations
(20150819)The central theme of the thesis is to study linear and non linear SVM formulations in the presence of uncertain observations. The main contribution of this thesis is to derive robust classfiers from partial knowledge of ...