Browsing Computer Science and Automation (CSA) by Title
Now showing items 187-206 of 559
-
Evolutionary design of plan based pattern recognition systems in complex domains
Many real-life Pattern Recognition (PR) problems do not fit into the classical PR paradigms. Such systems are currently being implemented using knowledge-based approaches. Designing such systems is an involved, evolutionary ... -
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 ... -
Experimental Studies On A New Class Of Combinatorial LDPC Codes
(2009-06-05)We implement a package for the construction of a new class of Low Density Parity Check (LDPC) codes based on a new random high girth graph construction technique, and study the performance of the codes so constructed on ... -
Experiments with the pentium Performance monitoring counters
(Indian Institute of Science, 2005-02-11)Performance monitoring counters are implemented in most recent microprocessors. In this thesis, we describe various performance measurement experiments for a program and a system that we conducted on a Linux operating ... -
Experiments With Unix Process Schedulers
(2012-05-09) -
Explainable and Efficient Neural Models for Natural Language to Bash Command Translation
One of the key goals of Natural Language Processing is to make computers understand natural language. Semantic Parsing has been one of the driving tasks for Natural Language Understanding. It is formally defined as the ... -
An Explainable Hierarchical Class Attention Model for Legal Appeal Automation
Judicial systems worldwide are overburdened due to the limited number of legal professionals. The digitization of legal processes has resulted in abundant legal data, paving the way for the development of legal automation ... -
An Exploratory Framework for Cyclone Identification and Tracking
Analyzing depressions plays an important role in meteorology, especially in the study of cyclones. In particular, the study of the temporal evolution of cyclones requires a robust depression tracking framework. To cope ... -
Exploring Fairness and Causality in Online Decision-Making
Online decision-making under uncertainty is a fundamental aspect of numerous real-world problems across various domains, including online resource allocation, crowd-sourcing, and online advertising. Multi-Armed Bandits ... -
Exploring Welfare Maximization and Fairness in Participatory Budgeting
Participatory budgeting (PB) is a voting paradigm for distributing a divisible resource, usually called a budget, among a set of projects by aggregating the preferences of individuals over these projects. It is implemented ... -
Extending Program Analysis Techniques to Web Applications and Distributed Systems
Web-based applications and distributed systems are ubiquitous and indispensable today. These systems use multiple parallel machines for greater functionality, and efficient and reliable computation. At the same time they ... -
Extension of path probability method to approximate inference over time
There has been a tremendous growth in publicly available digital video footage over the past decade. This has necessitated the development of new techniques in computer vision geared towards efficient analysis, storage, ... -
FA RCU: Fault Aware Read-Copy-Update
Deferred freeing is the fundamental technique used in Read-Copy-Update (RCU) synchronization technique where reclamation of resources is deferred until the completion of all active RCU read-side critical sections. We observe ... -
Facets of some combinatorial polytopes
A proven approach for solving hard combinatorial optimization problems is via polyhedral methods applied to integer programming formulations. Efficient algorithms for such problems are often problem specific and exploit ... -
Fair and Efficient Dynamic Memory De-bloating
The virtual memory abstraction simplifies programming and enhances portability but requires the processor to translate virtual addresses to physical addresses which can be expensive. To speed up the virtual-to-physical ... -
Falcon : A Graph Manipulation Language for Distributed Heterogeneous Systems
(2018-08-20)Graphs model relationships across real-world entities in web graphs, social network graphs, and road network graphs. Graph algorithms analyze and transform a graph to discover graph properties or to apply a computation. ... -
Fast Actively Secure OT Extension for Short Secrets
(2018-05-25)Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems ... -
Fast Algorithms for Max Cut on Geometric Intersection Graphs
In this work, we design fast algorithms for max cut on geometric intersection graphs. In the maximum cut (a.k.a., max cut) problem, the input is an undirected graph, and the goal is to partition the vertex set into two ... -
Fast primality testing algorithm study and implementation
In the previous chapters we discussed the details of some primality testing algorithms and the implementation of a fast deterministic primality testing algorithm. Our implementation consists of programs written in Pascal ...