7 papers
On Diverse Solutions to Max-k-CSP and Bounded Degree k-SAT
Mayank Goswami, Adarsh Srinivasan
We study the problem of generating diverse solutions to Max--CSP and bounded-degree -SAT, focusing on two distinct metrics: constraint diversity and variable diversity. For c…
RECAP: Transparent Inference-Time Emotion Alignment for Medical Dialogue Systems
Adarsh Srinivasan, Jacob Dineen, Muhammad Umar Afzal +3
Large language models in healthcare often produce emotionally flat or opaque responses, failing to provide the transparent reasoning required for clinical trust. We present RECAP (…
Container Data Item: An Abstract Datatype for Efficient Container-based Edge Computing
Md Rezwanur Rahman, Tarun Annapareddy, Shirin Ebadi +4
We present Container Data Item (CDI), an abstract datatype that allows multiple containers to efficiently operate on a common data item while preserving their strong security and i…
Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
Per Austrin, Ioana O. Bercea, Mayank Goswami +2
Given a -CNF formula and an integer , we study algorithms that obtain solutions to the formula that are maximally dispersed. For , the problem of computing the diame…
Impossibility of Depth Reduction in Explainable Clustering
Chengyuan Deng, Surya Teja Gavva, Karthik C. S. +2
Over the last few years Explainable Clustering has gathered a lot of attention. Dasgupta et al. [ICML'20] initiated the study of explainable -means and -median clustering pro…
A McEliece cryptosystem using permutation codes
Adarsh Srinivasan, Ayan Mahalanobis
This paper is an attempt to build a new public-key cryptosystem; similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem…
The Connected Domination Number of Grids
Adarsh Srinivasan, N S Narayanaswamy
Closed form expressions for the domination number of an grid have attracted significant attention, and an exact expression has been obtained in 2011 by Gonçalves et al…