Browsing Computer Science and Automation (CSA) by Title
Now showing items 118-137 of 394
-
Efficient Compilation Of Stream Programs Onto Multi-cores With Accelerators
(2010-12-30)Over the past two decades, microprocessor manufacturers have typically relied on wider issue widths and deeper pipelines to obtain performance improvements for single threaded applications. However, in the recent years, ... -
Efficient Frequent Closed Itemset Algorithms With Applications To Stream Mining And Classification
(2010-08-24)Data mining is an area to find valid, novel, potentially useful, and ultimately understandable abstractions in a data. Frequent itemset mining is one of the important data mining approaches to find those abstractions in ... -
Efficient Instrumentation for Object Flow Profiling
(2018-07-20)Profiling techniques to detect performance bugs in applications are usually customized to detect a specific bug pattern and involve significant engineering effort. In spite of this effort, many techniques either suffer from ... -
Efficient Kernel Methods For Large Scale Classification
(2011-02-22)Classification algorithms have been widely used in many application domains. Most of these domains deal with massive collection of data and hence demand classification algorithms that scale well with the size of the data ... -
Efficient Key Management Protocols for Secure Routing and End-to-End Key Establishment with Enhanced Security in Mobile Ad hoc Networks
There is a need to protect mobile ad hoc network (MANET) from external attackers as well as internal attackers during route discovery and end-to-end key establishment. During route discovery, the external attackers can be ... -
Efficient Key Management, and Intrusion Detection Protocols for Enhancing Security in Mobile Ad Hoc Networks
(2017-11-24)Security of communications is a major requirement for Mobile Adhoc NETworks(MANETs) since they use wireless channel for communications which can be easily tapped, and physical capture of MANET nodes is also quite easy. ... -
Efficient Online Path Profiling
(2009-06-05)Most dynamic program analysis techniques such as profile-driven compiler optimizations, software testing and runtime property checking infer program properties by profiling one or more executions of a program. Unfortunately, ... -
Efficient Schemes for Improving the Performance of Clock Synchronization Protocols in Wireless Sensor Networks Using TDMA- based MAC Protocols
(2018-05-16)Clock synchronization in a wireless sensor network (WSN) is essential as it provides a consistent and a coherent time frame for all the nodes across the network. Typically, clock synchronization is achieved by message ... -
Efficient Schemes for Partitioning Based Scheduling of Real-Time Tasks in Multicore Architecture
The correctness of hard real-time systems depends not only on its logical correctness but also, on its ability to meet all its deadline. Existing real-time systems use either a pure real-time scheduler or a real-time ... -
Efficient Static Analyses for Concurrent Programs
(2018-06-29)Concurrent programs are pervasive owing to the increasing adoption of multi-core systems across the entire computing spectrum. However, the large set of possible program behaviors make it difficult to write correct and ... -
Efficient Usage Of Flash Memories In High Performance Scenarios
(2016-09-09)New PCI-e flash cards and SSDs supporting over 100,000 IOPs are now available, with several usecases in the design of a high performance storage system. By using an array of flash chips, arranged in multiple banks, large ... -
Efficient Whole Program Path Tracing
(2018-06-14)Obtaining an accurate whole program path (WPP) that captures a program’s runtime behaviour in terms of a control-flow trace has a number of well-known benefits, including opportunities for code optimization, bug detection, ... -
Embedding Networks: Node and Graph Level Representations
Graph neural networks gained significant attention for graph representation and classification in the machine learning community. For graph classification, different pooling techniques are introduced, but none of them has ... -
Enhancing Coverage and Robustness of Database Generators
Generating synthetic databases that capture essential data characteristics of client databases is a common requirement for enterprise database vendors. This need stems from a variety of use-cases, such as application testing ... -
An Environment for Automatic Generation of Code Optimizers
(Indian Institute of Science, 2005-03-11)Code optimization or code transformation is a complex function of a compiler involving analyses and modifications with the entire program as its scope. In spite of its complexity, hardly any tools exist to support this ... -
Equivalence test for the trace iterated matrix multiplication polynomial
An m-variate polynomial f is affine equivalent to an n-variate polynomial g if m > n and there is a full rank n * m matrix A and a n-dimensional vector b such that f(x) = g(Ax + b). Given blackbox access to f and g (i.e ... -
An Evaluation of Basic Protection Mechanisms in Financial Apps on Mobile Devices
This thesis concerns the robustness of security checks in financial mobile applications (or simply financial apps). The best practices recommended by OWASP for developing such apps demand that developers include several ... -
Expanders in Arithmetic Circuit Lower Bound : Towards a Separation Between ROABPs and Multilinear Depth 3 Circuits
Consider the problem of Polynomial Identity Testing(PIT): we are given an arithmetic circuit computing a multivariate polynomial over some eld and we have to determine whether that polynomial is identically zero or not. ... -
Experiences in using Reinforcement Learning for Directed Fuzzing
Directed testing is a technique to analyze user-specified target locations in the program. It reduces the time and effort of developers by excluding irrelevant parts of the program from testing and focusing on reaching ...