15 citations · 47 across the 14 of their papers we have counts for
16 papers
Finite-sample concentration of the empirical relative entropy around its mean
Rohit Agrawal
In this note, we show that the relative entropy of an empirical distribution of samples drawn from a set of size with respect to the true underlying distribution is exponen…
SABMIS: Sparse approximation based blind multi-image steganography scheme
Rohit Agrawal, Kapil Ahuja, Marc C. Steinbach +1
We hide grayscale secret images into a grayscale cover image, which is considered to be a challenging steganography problem. Our goal is to develop a steganography scheme with enha…
A Generalization of Deodhar's Framework for Questions in Kazhdan-Lusztig Theory
Rohit Agrawal, Vladimir Sotirov
We make progress on a question of Skandera by showing that a product of Kazhdan-Lusztig basis elements indexed by maximal elements of parabolic subgroups admits a Kazhdan-Lusztig b…
CSIS: compressed sensing-based enhanced-embedding capacity image steganography scheme
Rohit Agrawal, Kapil Ahuja
Image steganography plays a vital role in securing secret data by embedding it in the cover images. Usually, these images are communicated in a compressed format. Existing techniqu…
ParaLarH: Parallel FPGA Router based upon Lagrange Heuristics
Rohit Agrawal, Kapil Ahuja, Dhaarna Maheshwari +1
Routing of the nets in Field Programmable Gate Array (FPGA) design flow is one of the most time consuming steps. Although Versatile Place and Route (VPR), which is a commonly used…
SABMIS: -minimization and sparse approximation based blind multi-image steganography scheme
Rohit Agrawal
Steganography plays a vital role in achieving secret data security by embedding it into cover media. The cover media and the secret data can be text or multimedia, such as images,…
Optimal Bounds between -Divergences and Integral Probability Metrics
Rohit Agrawal, Thibaut Horel
The families of -divergences (e.g. the Kullback-Leibler divergence) and Integral Probability Metrics (e.g. total variation distance or maximum mean discrepancies) are widely use…
HTS: A Hardware Task Scheduler for Heterogeneous Systems
Kartik Hegde, Abhishek Srivastava, Rohit Agrawal
As the Moore's scaling era comes to an end, application specific hardware accelerators appear as an attractive way to improve the performance and power efficiency of our computing…
Coin Theorems and the Fourier Expansion
Rohit Agrawal
In this note we compare two measures of the complexity of a class of Boolean functions studied in (unconditional) pseudorandomness: 's ability to distingui…
Samplers and Extractors for Unbounded Functions
Rohit Agrawal
Blasiok (SODA'18) recently introduced the notion of a subgaussian sampler, defined as an averaging sampler for approximating the mean of functions such…
Finite-Sample Concentration of the Multinomial in Relative Entropy
Rohit Agrawal
We show that the moment generating function of the Kullback-Leibler divergence (relative entropy) between the empirical distribution of independent samples from a distribution…
Unifying computational entropies via Kullback-Leibler divergence
Rohit Agrawal, Yi-Hsiu Chen, Thibaut Horel +1
We introduce hardness in relative entropy, a new notion of hardness for search problems which on the one hand is satisfied by all one-way functions and on the other hand implies bo…
Morph: Flexible Acceleration for 3D CNN-based Video Understanding
Kartik Hegde, Rohit Agrawal, Yulun Yao +1
The past several years have seen both an explosion in the use of Convolutional Neural Networks (CNNs) and the design of accelerators to make CNN inference practical. In the archite…
UCNN: Exploiting Computational Reuse in Deep Neural Networks via Weight Repetition
Kartik Hegde, Jiyong Yu, Rohit Agrawal +3
Convolutional Neural Networks (CNNs) have begun to permeate all corners of electronic society (from voice recognition to scene generation) due to their high accuracy and machine ef…
Parallel FPGA Router using Sub-Gradient method and Steiner tree
Rohit Agrawal, Chin Hao Hoo, Kapil Ahuja +1
In the FPGA (Field Programmable Gate Arrays) design flow, one of the most time-consuming step is the routing of nets. Therefore, there is a need to accelerate it. In a recent paper…
Involutions on standard Young tableaux and divisors on metric graphs
Rohit Agrawal, Gregg Musiker, Vladimir Sotirov +1
We elaborate upon a bijection discovered by Cools, Draisma, Payne, and Robeva between the set of rectangular standard Young tableaux and the set of equivalence classes of chip conf…