Browsing Computer Science and Automation (CSA) by Title
Now showing items 195-214 of 552
-
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 ... -
Fault tolerance in feedforward neural networks using minimax optimization
Neural computing is currently being proposed as a viable solution to several problems. The approach of neural computing is to capture the guiding principles that underlie the functioning of the human brain and apply them ... -
Fault tolerant locking for shared disk filesystems
Shared disk files ystems are crucial for providing direct, shared and high performance file system access on top of raw block based Storage Area Networks. One of the key components of a shared disk file system is a ... -
Fault-tolerant distributed algorithms for reconfiguration of rings using management tokens
In this thesis, we propose two algorithms using slightly different approaches to detect failures in a ring, and to reconfigure the ring using a combination of multithreading and management tokens which circulate around the ... -
Feature Adaptation Algorithms for Reinforcement Learning with Applications to Wireless Sensor Networks And Road Traffic Control
(2017-09-20)Many sequential decision making problems under uncertainty arising in engineering, science and economics are often modelled as Markov Decision Processes (MDPs). In the setting of MDPs, the goal is to and a state dependent ... -
Feature Selection under Multicollinearity & Causal Inference on Time Series
(2018-08-20)In this work, we study and extend algorithms for Sparse Regression and Causal Inference problems. Both the problems are fundamental in the area of Data Science. The goal of regression problem is to nd out the \best" ... -
Feature Tracking and Visual Analysis of Temporal Scalar Fields in the Ocean
The Bay of Bengal (BoB) has maintained its salinity distribution over the years despite a continuous flow of fresh water entering it through rivers on the northern coast, which can dilute its salinity. This can be ... -
A Fine-Grained Dynamic Information Flow Analysis for Android Apps
(2018-08-20)Android has been steadily gaining popularity ever since its launch in 2008. One of the major factors for this is the easy availability of a large variety of apps. They range from simple apps such as calculator apps to apps ... -
Finite field transforms applicatons to cryptography and error free polynimial matrix computation
In this dissertation, we have presented the properties of finite field transforms and a few of their applications. We do not consider our study exhaustive, and we expect other applications to be developed soon. The most ... -
Formal Models for Code Generation and Code Compression
We propose formal models for the problems of target code generation and compression of tree intermediate code. For the first problem, we adapt an existing model to work for prefix linearizations of intermediate tree code. ... -
Formal tools for specification-driven protocol design of distributed computing systems
The widespread use of Distributed Computing Systems (DCSs) is due to the advantages of better performance, improved reliability, efficient resource sharing and easy upgradability. In order to realize the advantages of a ...