Streaming submodular maximization is a natural model for the task of
sel...
A motif is a frequently occurring subgraph of a given directed or undire...
Random walks are a fundamental primitive used in many machine learning
a...
The Boolean Hidden Matching (BHM) problem, introduced in a seminal paper...
The community detection problem requires to cluster the nodes of a netwo...
Graph sparsification has been studied extensively over the past two deca...
Cut and spectral sparsification of graphs have numerous applications,
in...
In this paper we revisit the problem of constructing randomized composab...
Submodular maximization has become established as the method of choice f...
Given a source of iid samples of edges of an input graph G with n
vertic...
In this paper we consider the problem of computing spectral approximatio...