Computer Science and Automation (CSA): Recent submissions
Now showing items 61-80 of 387
-
Analysis and Methods for Knowledge Graph Embeddings
Knowledge Graphs (KGs) are multi-relational graphs where nodes represent entities, and typed edges represent relationships among entities. These graphs store real-world facts such as (Lionel Messi, plays-for-team, Barcelona) ... -
High Performance GPU Tensor Core Code Generation for Matmul using MLIR
State of the art in high-performance deep learning is primarily driven by highly tuned libraries. These libraries are often hand-optimized and tuned by expert programmers using low-level abstractions with significant effort. ... -
Security of Post-Quantum Multivariate Blind Signature Scheme: Revisited and Improved
Current cryptosystems face an imminent threat from quantum algorithms like Shor's and Grover's, leading us to post-quantum cryptography. Multivariate signatures are prominent in post-quantum cryptography due to their fast, ... -
Deep Learning over Hypergraphs
Graphs have been extensively used for modelling real-world network datasets, however, they are restricted to pairwise relationships, i.e., each edge connects exactly two vertices. Hypergraphs relax the notion of edges ... -
MPCLeague: Robust MPC Platform for Privacy-Preserving Machine Learning
In the modern era of computing, machine learning tools have demonstrated their potential in vital sectors, such as healthcare and finance, to derive proper inferences. The sensitive and confidential nature of the data in ... -
Quantum-Safe Identity-Based Signature Scheme in Multivariate Quadratic Setting
Cryptographic techniques are essential for the security of communication in modern society. Today, nearly all public key cryptographic schemes used in practice are based on the two problems of factoring large integers and ... -
A Syntactic Neural Model For Question Decomposition
Question decomposition along with single-hop Question Answering (QA) system serve as useful modules in developing multi-hop Question Answering systems, mainly because the resulting QA system is interpretable and has been ... -
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 ... -
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 ... -
Statistical Network Analysis: Community Structure, Fairness Constraints, and Emergent Behavior
Networks or graphs provide mathematical tools for describing and analyzing relational data. They are used in biology to model interactions between proteins, in economics to identify trade alliances among countries, in ... -
Problems on bend-number, circular separation dimension and maximum edge 2-colouring
Representation of graphs as the intersection graphs of geometric objects has a long history. The objective is to a nd a collection of \simple" sets S such that a given graph G is its intersection graph. We are interested ... -
Guarding Terrain using k-Watchtowers
The discrete k-watchtower problem for a polyhedral terrain T in R3 with n vertices is to nd k vertical segments, called watchtowers, of smallest height, whose bottom end-points (bases) lie on some vertices of T, and ... -
Stochastic approximation with set-valued maps and Markov noise: Theoretical foundations and applications
Stochastic approximation algorithms produce estimates of a desired solution using noisy real world data. Introduced by Robbins and Monro, in 1951, stochastic approximation techniques have been instrumental in the asymptotic ... -
Adaptively Secure Primitives in the Random Oracle Model
Adaptive security embodies one of the strongest notions of security that allows an adversary to corrupt parties at any point during protocol execution and gain access to its internal state. Since it models reallife situations ... -
Structured Regularization Through Convex Relaxations Of Discrete Penalties
Motivation. Empirical risk minimization(ERM) is a popular framework for learning predictive models from data, which has been used in various domains such as computer vision, text processing, bioinformatics, neuro-biology, ... -
A Trusted-Hardware Backed Secure Payments Platform for Android
Digital payments using personal electronic devices have been steadily gaining in popularity for the last few years. While digital payments using smartphones are very convenient, they are also more susceptible to security ... -
Handling Overloads with Social Consistency
Cloud computing applications have dynamic workloads, and they often observe spikes in the incoming traffic which might result in system overloads. System overloads are generally handled by various load balancing techniques ... -
Typestates and Beyond: Verifying Rich Behavioral Properties Over Complex Programs
Statically verifying behavioral properties of programs is an important research problem. An efficient solution to this problem will have visible effects over multiple domains, ranging from program development, program ... -
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 ... -
Algorithms for Multilingual IR in Low Resource Languages using Weakly Aligned Corpora
Multilingual information retrieval (MLIR) methods generally rely on linguistic resources such as dictionaries, parallel corpora, etc., to overcome the language barrier. For low resource languages without these resources, ...