Browsing Computer Science and Automation (CSA) by Title
Now showing items 168-187 of 351
-
An Improved Lower Bound for Multi-r-ic Depth Four Circuits as a Function of the Number of Input Variables
In this work we study the multi-r-ic formula model introduced by [KS15c] and improve upon the lower bound for multi-r-ic depth four circuits given in [KST16b], when viewed as a function of the number of input variables ... -
Improving Last-Level Cache Performance in Single and Multi-Core Processsors
(2018-04-23)With off-chip memory access taking 100's of processor cycles, getting data to the processor in a timely fashion remains one of the key performance bottlenecks in current systems. With increasing core counts, this problem ... -
Improving the Precision of a Scalable Demand-Driven Null- Dereference Verification for Java
(2018-03-19)The problem addressed in this thesis is sound, scalable, demand-driven null-dereference verification for Java programs via over-approximated weakest preconditions analysis. The base version of this analysis having been ... -
Incentive Design for Crowdfunding and Crowdsourcing Markets
(2018-05-23)With the ever-increasing trend in the number of social interactions getting intermediated by technology (the world wide web) as the backdrop, this thesis focuses on the design of mechanisms for online communities (crowds) ... -
Incentive Strategies and Algorithms for Networks, Crowds and Markets
(2018-08-02)This work is motivated by several modern applications involving social networks, crowds, and markets. Our work focuses on the theme of designing effective incentive strategies for these applications. Viral marketing is ... -
Integrated Parallel Simulations and Visualization for Large-Scale Weather Applications
(2018-07-28)The emergence of the exascale era necessitates development of new techniques to efficiently perform high-performance scientific simulations, online data analysis and on-the-fly visualization. Critical applications like ... -
Integrated Scheduling For Clustered VLIW Processors
(Indian Institute of Science, 2005-11-25)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. Scheduling for clustered architectures ... -
Integrated Scheduling For Distributed Systems
(2013-07-31) -
Integrating A New Cluster Assignment And Scheduling Algorithm Into An Experimental Retargetable Code Generation Framework
(2009-03-09)This thesis presents a new unified 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 Read-Copy-Update Synchronization and Memory Allocation
The evolution of multicore systems with thousands of cores has led to the exploration of non-traditional procrastination-based synchronization techniques such as Read-Copy- Update (RCU). Deferred destruction is the ... -
Interactive Virtual Machining : A Voxel Based Approach
(2013-07-24) -
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 ... -
Investigations on CPI Centric Worst Case Execution Time Analysis
(2018-03-19)Estimating program worst case execution time (WCET) is an important problem in the domain of real-time systems and embedded systems that are deadline-centric. 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
(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 ... -
Kernel Methods Fast Algorithms and real life applications
(Indian Institute of Science, 2005-02-08)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 Knowledge-Based Approach To Pattern Clustering
(Indian Institute of Science, 2005-03-11)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, 2005-02-16)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, 2005-12-07)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 ...