7 citations · 20 across the 8 of their papers we have counts for
15 papers
Minwise-Independent Permutations with Insertion and Deletion of Features
Rameshwar Pratap, Raghav Kulkarni
In their seminal work, Broder \textit{et. al.}~\citep{BroderCFM98} introduces the algorithm that computes a low-dimensional sketch of high-dimensional binary dat…
Improving \textit{Tug-of-War} sketch using Control-Variates method
Rameshwar Pratap, Bhisham Dev Verma, Raghav Kulkarni
Computing space-efficient summary, or \textit{a.k.a. sketches}, of large data, is a central problem in the streaming algorithm. Such sketches are used to answer \textit{post-hoc} q…
Shortest -Disjoint Paths via Determinants
Samir Datta, Siddharth Iyer, Raghav Kulkarni +1
The well-known -disjoint path problem (-DPP) asks for pairwise vertex-disjoint paths between specified pairs of vertices in a given graph, if they exist. The…
Efficient Compression Technique for Sparse Sets
Rameshwar Pratap, Ishan Sohony, Raghav Kulkarni
Recent technological advancements have led to the generation of huge amounts of data over the web, such as text, image, audio and video. Most of this data is high dimensional and s…
On the Spectral Properties of Symmetric Functions
Anil Ada, Omar Fawzi, Raghav Kulkarni
We characterize the approximate monomial complexity, sign monomial complexity , and the approximate L 1 norm of symmetric functions in terms of simple combinatorial measures of the…
Similarity preserving compressions of high dimensional sparse data
Raghav Kulkarni, Rameshwar Pratap
The rise of internet has resulted in an explosion of data consisting of millions of articles, images, songs, and videos. Most of this data is high dimensional and sparse. The need…