Hierarchical and tree-like data sets arise in many applications, includi...
Pathogenic infections pose a significant threat to global health, affect...
Graph learning methods, such as Graph Neural Networks (GNNs) based on gr...
The eXtreme Multi-label Classification (XMC) problem seeks to find relev...
Motivated by testing for pathogenic diseases we consider a new nonadapti...
Balanced and swap-robust minimal trades, introduced in [1], are importan...
Motivated by applications in polymer-based data storage we introduced th...
The Secretary problem is a classical sequential decision-making question...
As the demand for user privacy grows, controlled data removal (machine
u...
Federated clustering is an unsupervised learning problem that arises in ...
In 2021, the Coordinated Science Laboratory CSL, an Interdisciplinary
Re...
Graph-structured data is ubiquitous in practice and often processed usin...
The problem of fitting distances by tree-metrics has received significan...
Many high-dimensional practical data sets have hierarchical structures
i...
Trades, introduced by Hedayat, are two sets of blocks of elements which ...
Learning on graphs has attracted significant attention in the learning
c...
The problem of reconstructing strings from substring information has fou...
Many high-dimensional and large-volume data sets of practical relevance ...
Candidates arrive sequentially for an interview process which results in...
Hypergraphs are used to model higher-order interactions amongst agents a...
Embedding methods for mixed-curvature spaces are powerful techniques for...
Semiquantitative group testing (SQGT) is a pooling method in which the t...
We introduce the problem of query-based selection of the optimal candida...
The well-known secretary problem in sequential analysis and optimal stop...
The first part of the paper presents a review of the gold-standard testi...
The problem of string reconstruction from substring information has foun...
We propose new repair schemes for Reed-Solomon codes that use subspace
p...
The problem of estimating the support of a distribution is of great
impo...
In many important applications, the acquired graph-structured data inclu...
Motivated by polymer-based data-storage platforms that use chains of bin...
We consider the problem of correcting mass readout errors in information...
Motivated by applications in topological DNA-based data storage, we intr...
Generative graph models create instances of graphs that mimic the proper...
The main obstacles for the practical deployment of DNA-based data storag...
We describe the first known mean-field study of landing probabilities fo...
Storage architectures ranging from minimum bandwidth regenerating encode...
Landing probabilities (LP) of random walks (RW) over graphs encode rich
...
Motivated by polymer-based data-storage platforms that use chains of bin...
Dictionary learning is a dimensionality reduction technique widely used ...
Motivated by average-case trace reconstruction and coding for portable
D...
We introduce a new convex optimization problem, termed quadratic decompo...
We introduce a new framework for estimating the support size of an unkno...
We introduce a general class of codes which includes several well-known
...
Higher-order motif structures and multi-vertex interactions are becoming...
Motivated by applications in social and biological network analysis, we
...
We introduce a new convex optimization problem, termed quadratic decompo...
We consider the problem of approximate K-means clustering with outliers ...
The problem of reconstructing strings from their substring spectra has a...
We introduce a new approach to decomposable submodular function minimiza...
We introduce submodular hypergraphs, a family of hypergraphs that have
d...