Search
Now showing items 261-270 of 559
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 MLIR-Based High-Level Synthesis Compiler for Hardware Accelerator Design
The emergence of machine learning, image and audio processing on edge devices has motivated research towards power-efficient custom hardware accelerators. Though FPGAs are an ideal target for custom accelerators, the ...
Average Reward Actor-Critic with Deterministic Policy Search
The average reward criterion is relatively less studied as most existing works in the Reinforcement Learning literature consider the discounted reward criterion. There are few recent works that present on-policy average ...
Design, Implementation, and Analysis of a TLB-based Covert Channel on GPUs
GPUs are now commonly available in most modern computing platforms. They are increasingly being
adopted in cloud platforms and data centers due to their immense computing capability. In response to
this growth in usage, ...
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 ...
A Context-Aware Neural Approach for Explainable Citation Link Prediction
Citations have become an integral part of scientific publications. They play a crucial role in supporting authors’ claims throughout a scientific paper. However, citing related work is a challenging and laborious task, ...
Approximation Algorithms for Geometric Packing Problems
We study approximation algorithms for the geometric bin packing problem and its variants. In the two-dimensional geometric bin packing problem (2D GBP), we are given n rectangular items and we have to compute an axis-parallel ...
Battle of Bandits: Online Learning from Subsetwise Preferences and Other Structured Feedback
The elicitation and aggregation of preferences is often the key to making better decisions. Be it a perfume company wanting to relaunch their 5 most popular fragrances, a movie recommender system trying to rank the most ...
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 ...
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 ...

