Sandeep Silwal

activity

20182026

most citedDirected Random Geometric Graphs

9 citations · 14 across the 8 of their papers we have counts for

collaborators

Showing cs.DSShow all

5 papers · 1 filter

cs.DS2025

Even Faster Kernel Matrix Linear Algebra via Density Estimation

Rikhav Shah, Sandeep Silwal, Haike Xu

This paper studies the use of kernel density estimation (KDE) for linear algebraic tasks involving the kernel matrix of a collection of $n$ data points in $R^{d}$ . In particu…

cs.DS2020

A Concentration Inequality for the Facility Location Problem

Sandeep Silwal

We give a concentration inequality for a stochastic version of the facility location problem. We show the objective $C_n = \min_{F \subseteq [0,1]^2}|F|+\sum_{x\in X}\min_{f\in F}\…

cs.DS2020

Smoothed analysis of the condition number under low-rank perturbations

Rikhav Shah, Sandeep Silwal

Let $M$ be an arbitrary $n$ by $n$ matrix of rank $n - k$ . We study the condition number of $M$ plus a \emph{low-rank} perturbation $U V^{T}$ where $U, V$ are $n$ by $k$ random Gaussian…

cs.DS2019

Property Testing of LP-Type Problems

Rogers Epstein, Sandeep Silwal

Given query access to a set of constraints $S$ , we wish to quickly check if some objective function $φ$ subject to these constraints is at most a given value $k$ . We approach this…

cs.DS2018

Spectral methods for testing cluster structure of graphs

Sandeep Silwal, Jonathan Tidor

In the framework of graph property testing, we study the problem of determining if a graph admits a cluster structure. We say that a graph is $(k, ϕ)$ -clusterable if it can be part…