Search Results - "Advani, Rishi"

Online Maximum Independent Set of Hyperrectangles by Advani, Rishi, Asudeh, Abolfazl

“…The maximum independent set problem is a classical NP-hard problem in theoretical computer science. In this work, we study a special case where the family of…”
Get full text

On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs by Advani, Rishi

“…There is empirical evidence supporting the claim that almost all cubic non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related conjecture…”
Get full text

Efficient Algorithms for Constructing an Interpolative Decomposition by Advani, Rishi, O'Hagan, Sean

“…Low-rank approximations are essential in modern data science. The interpolative decomposition provides one such approximation. Its distinguishing feature is…”
Get full text

[Experiments & Analysis] Evaluating the Feasibility of Sampling-Based Techniques for Training Multilayer Perceptrons by Ebrahimi, Sana, Advani, Rishi, Asudeh, Abolfazl

“…The training process of neural networks is known to be time-consuming, and having a deep architecture only aggravates the issue. This process consists mostly…”
Get full text

Maximizing Neutrality in News Ordering by Advani, Rishi, Papotti, Paolo, Asudeh, Abolfazl

“…Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD '23) (2023) 11--24 The detection of fake news has received increasing…”
Get full text

Decentralized Fair Division by Miller, Joel, Advani, Rishi, Kash, Ian, Kanich, Chris, Zuck, Lenore

“…Fair division is typically framed from a centralized perspective. We study a decentralized variant of fair division inspired by the dynamics observed in…”
Get full text

Random Projections and Dimension Reduction by Advani, Rishi, Crim, Madison, O'Hagan, Sean

“…This paper, broadly speaking, covers the use of randomness in two main areas: low-rank approximation and kernel methods. Low-rank approximation is very…”
Get full text