Browsing Computer Science and Automation (CSA) by Title
Now showing items 181-200 of 391
-
Identification and Quantification of Important Voids and Pockets in Proteins
(2018-04-05)Many methods of analyzing both the physical and chemical behavior of proteins require information about its structure and stability. Also various other parameters such as energy function, solvation, hydrophobic/hydrophilic ... -
Identifying Method Memoization Opportunities in Java Programs
(2017-12-13)Memorization of a method is a commonly used re-factoring wherein developer modules the code of a method to save return values for some or all incoming parameter values. Whenever a parameter-tuple is received for the second ... -
Image Structures For Steganalysis And Encryption
(2013-10-21)In this work we study two aspects of image security: improper usage and illegal access of images. In the first part we present our results on steganalysis – protection against improper usage of images. In the second part ... -
IMAGINE : An Intelligent Electonic Marketplace
(Indian Institute of Science, 2007-01-16)In recent times, the Internet revolution has spawned numerous innovative enterprises-virtual companies, and electronic markets. Electronic markets (or digital markets) are scalable web-based platforms for buyers, sellers, ... -
An Implementation of Cross Architecture Procedure Call
(Indian Institute of Science, 2005-01-26)workstations are ideally suited for computing jobs which require an interactive environment because they are basically single user machines and hence provide consistent response time. Another factor is the availability ... -
Implementation Of Database Security Features Using Bit Matrices
(Indian Institute of Science, 2005-02-16)Information security is of utmost concern in a multiuser environment. The importance of security is felt much more with the widespread use of distributed database. Information is by itself a critical resource of an enterprise ... -
Improved Algorithms for Variants of Bin Packing and Knapsack
We study variants of two classical optimization problems: Bin Packing and Knapsack. Both bin packing and knapsack fall under the regime of "Packing and Covering Problems". In bin packing, we are given a set of input items, ... -
Improved approximation bounds on maximum edge q coloring of dense graphs
The anti-Ramsey number ar(G,H) with input graph G and pattern graph H, is the maximum positive integer k such that there exists an edge coloring of G using k colors, in which there are no rainbow subgraphs isomorphic to ... -
An Improved Lower Bound for Depth four Arithmetic Circuits
(2018-05-29)We study the problem of proving lower bounds for depth four arithmetic circuits. Depth four circuits have been receiving much attraction when it comes to recent circuit lower bound results, as a result of the series of ... -
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 ... -
Inducing Constraints in Paraphrase Generation and Consistency in Paraphrase Detection
Deep learning models typically require a large volume of data. Manual curation of datasets is time-consuming and limited by imagination. As a result, natural language generation (NLG) has been employed to automate the ... -
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 ...