
-
Finding the Second-Best Candidate under the Mallows Model
The well-known secretary problem in sequential analysis and optimal stop...
read it
-
AC-DC: Amplification Curve Diagnostics for Covid-19 Group Testing
The first part of the paper presents a review of the gold-standard testi...
read it
-
Reconstructing Mixtures of Coded Strings from Prefix and Suffix Compositions
The problem of string reconstruction from substring information has foun...
read it
-
Repairing Reed-Solomon Codes via Subspace Polynomials
We propose new repair schemes for Reed-Solomon codes that use subspace p...
read it
-
Support Estimation with Sampling Artifacts and Errors
The problem of estimating the support of a distribution is of great impo...
read it
-
Joint Adaptive Feature Smoothing and Topology Extraction via Generalized PageRank GNNs
In many important applications, the acquired graph-structured data inclu...
read it
-
Coding for Polymer-Based Data Storage
Motivated by polymer-based data-storage platforms that use chains of bin...
read it
-
Mass Error-Correction Codes for Polymer-Based Data Storage
We consider the problem of correcting mass readout errors in information...
read it
-
Group Testing with Runlength Constraints for Topological Molecular Storage
Motivated by applications in topological DNA-based data storage, we intr...
read it
-
Multi-MotifGAN (MMGAN): Motif-targeted Graph Generation and Prediction
Generative graph models create instances of graphs that mimic the proper...
read it
-
Image processing in DNA
The main obstacles for the practical deployment of DNA-based data storag...
read it
-
Landing Probabilities of Random Walks for Seed-Set Expansion in Hypergraphs
We describe the first known mean-field study of landing probabilities fo...
read it
-
Access Balancing in Storage Systems by Labeling Partial Steiner Systems
Storage architectures ranging from minimum bandwidth regenerating encode...
read it
-
Optimizing Generalized PageRank Methods for Seed-Expansion Community Detection
Landing probabilities (LP) of random walks (RW) over graphs encode rich ...
read it
-
Reconstruction and Error-Correction Codes for Polymer-Based Data Storage
Motivated by polymer-based data-storage platforms that use chains of bin...
read it
-
Online Convex Dictionary Learning
Dictionary learning is a dimensionality reduction technique widely used ...
read it
-
Coded trace reconstruction
Motivated by average-case trace reconstruction and coding for portable D...
read it
-
Quadratic Decomposable Submodular Function Minimization: Theory and Practice
We introduce a new convex optimization problem, termed quadratic decompo...
read it
-
Support Estimation via Regularized and Weighted Chebyshev Approximations
We introduce a new framework for estimating the support size of an unkno...
read it
-
Explicit Formulas for the Weight Enumerators of Some Classes of Deletion Correcting Codes
We introduce a general class of codes which includes several well-known ...
read it
-
Higher-Order Spectral Clustering under Superimposed Stochastic Block Model
Higher-order motif structures and multi-vertex interactions are becoming...
read it
-
Motif and Hypergraph Correlation Clustering
Motivated by applications in social and biological network analysis, we ...
read it
-
Quadratic Decomposable Submodular Function Minimization
We introduce a new convex optimization problem, termed quadratic decompo...
read it
-
Query K-means Clustering and the Double Dixie Cup Problem
We consider the problem of approximate K-means clustering with outliers ...
read it
-
Unique Reconstruction of Coded Strings from Multiset Substring Spectra
The problem of reconstructing strings from their substring spectra has a...
read it
-
Revisiting Decomposable Submodular Function Minimization with Incidence Relations
We introduce a new approach to decomposable submodular function minimiza...
read it
-
Submodular Hypergraphs: p-Laplacians, Cheeger Inequalities and Spectral Clustering
We introduce submodular hypergraphs, a family of hypergraphs that have d...
read it
-
Inhomogeneous Hypergraph Clustering with Applications
Hypergraph partitioning is an important problem in machine learning, com...
read it
-
Efficient Rank Aggregation via Lehmer Codes
We propose a novel rank aggregation method based on converting permutati...
read it
-
Multiclass MinMax Rank Aggregation
We introduce a new family of minmax rank aggregation problems under two ...
read it