research
∙
12/07/2022
DeMEtRIS: Counting (near)-Cliques by Crawling
We study the problem of approximately counting cliques and near cliques ...
share
research
∙
04/17/2022
A New Dynamic Algorithm for Densest Subhypergraphs
Computing a dense subgraph is a fundamental problem in graph mining, wit...
research
∙
12/11/2020
Online Coresets for Clustering with Bregman Divergences
We present algorithms that create coresets in an online setting for clus...
research
∙
08/25/2020
Efficient Hierarchical Clustering for Classification and Anomaly Detection
We address the problem of large scale real-time classification of conten...
research
∙
06/01/2020
Streaming Coresets for Symmetric Tensor Factorization
Factorizing tensors has recently become an important optimization module...
research
∙
06/27/2019
BioGen: Automated Biography Generation
A biography of a person is the detailed description of several life even...
research
∙
10/16/2018
Nearly Optimal Space Efficient Algorithm for Depth First Search
We design a space-efficient algorithm for performing depth-first search ...
research
∙
09/12/2018
