English
Related papers

Related papers: Subpolynomial trace reconstruction for random stri…

200 papers

A tandem duplication denotes the process of inserting a copy of a segment of DNA adjacent to its original position. More formally, a tandem duplication can be thought of as an operation that converts a string $S = AXB$ into a string $T =…

Computational Complexity · Computer Science 2021-03-16 Ferdinando Cicalese , Nicolò Pilati

We consider the phase retrieval problem, in which the observer wishes to recover a $n$-dimensional real or complex signal $\mathbf{X}^\star$ from the (possibly noisy) observation of $|\mathbf{\Phi} \mathbf{X}^\star|$, in which…

Information Theory · Computer Science 2022-10-03 Antoine Maillard , Florent Krzakala , Yue M. Lu , Lenka Zdeborová

The problem of reconstructing and identifying intracellular protein signaling and biochemical networks is of critical importance in biology today. We sought to develop a mathematical approach to this problem using, as a test case, one of…

Data Analysis, Statistics and Probability · Physics 2012-06-15 D. Napoletani , T. Sauer , D. C. Struppa , E. Petricoin , L. Liotta

This paper concerns the problem of recovering an unknown but structured signal $x \in R^n$ from $m$ quadratic measurements of the form $y_r=|<a_r,x>|^2$ for $r=1,2,...,m$. We focus on the under-determined setting where the number of…

Machine Learning · Computer Science 2017-02-22 Mahdi Soltanolkotabi

The reduction of the fragment assembly problem to (variations of) the classical Eulerian trail problem [Pevzner et al., PNAS 2001] has led to remarkable progress in genome assembly. This reduction employs the notion of de Bruijn graph…

Data Structures and Algorithms · Computer Science 2025-10-17 Ben Bals , Sebastiaan van Krieken , Solon P. Pissis , Leen Stougie , Hilde Verbeek

The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…

Data Structures and Algorithms · Computer Science 2024-03-12 R. Krithika , V. K. Kutty Malu , Prafullkumar Tale

We investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. In the Tucker decomposition framework, we show that the Riemannian optimization algorithm with initial value…

Machine Learning · Statistics 2019-11-13 Jian-Feng Cai , Lizhang Miao , Yang Wang , Yin Xian

Let $G$ be a $3$-connected ordered graph with $n$ vertices and $m$ edges. Let $\mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $\{1, 2,3, \ldots, 2^b\}$ for $b\ge m^2$. Let $\ell$ be the vector of $m$…

Metric Geometry · Mathematics 2024-06-27 Robert Connelly , Steven J. Gortler , Louis Theran

Suppose we wish to recover a signal x in C^n from m intensity measurements of the form |<x,z_i>|^2, i = 1, 2,..., m; that is, from data in which phase information is missing. We prove that if the vectors z_i are sampled independently and…

Information Theory · Computer Science 2011-09-22 Emmanuel J. Candes , Thomas Strohmer , Vladislav Voroninski

A matrix is given in ``shredded'' form if we are presented with the multiset of rows and the multiset of columns, but not told which row is which or which column is which. The matrix is reconstructible if it is uniquely determined by this…

Combinatorics · Mathematics 2024-01-11 Paul Balister , Gal Kronenberg , Alex Scott , Youri Tamitegama

In this paper, we study the generalized phase retrieval problem: to recover a signal $\bm{x}\in\mathbb{C}^n$ from the measurements $y_r=\lvert \langle\bm{a}_r,\bm{x}\rangle\rvert^2$, $r=1,2,\ldots,m$. The problem can be reformulated as a…

Optimization and Control · Mathematics 2016-07-06 Ji Li , Tie Zhou

We consider the problem of reconstructing a function $f\in L^2(\mathbb{R})$ given phase-less samples of its Gabor transform, which is defined by $$\mathcal{G} f(x,\omega) := 2^{\frac14} \int_{\mathbb{R}} f(t) e^{-\pi (t-x)^2} e^{-2\pi i y…

Classical Analysis and ODEs · Mathematics 2023-10-18 Philippe Jaming , Martin Rathmair

Motivated by the study of deletion channels, this work presents improved bounds on the number of subsequences obtained from a binary sting X of length n under t deletions. It is known that the number of subsequences in this setting strongly…

Information Theory · Computer Science 2012-02-09 Y. Liron , M. Langberg

Evaluation of residual elastic strain within the bulk of engineering components or natural objects is a challenging task, since in general it requires mapping a six-component tensor quantity in three dimensions. A further challenge concerns…

The growth of data today poses a challenge in management and inference. While feature extraction methods are capable of reducing the size of the data for inference, they do not help in minimizing the cost of data storage. On the other hand,…

Machine Learning · Computer Science 2022-03-04 Thu Nguyen , Thanh Nhan Phan , Van Nhuong Nguyen , Thanh Binh Nguyen , Pål Halvorsen , Michael Riegler

This paper provides new error bounds on "consistent" reconstruction methods for signals observed from quantized random projections. Those signal estimation techniques guarantee a perfect matching between the available quantized data and a…

Information Theory · Computer Science 2016-04-21 Laurent Jacques

RNA-Seq technology offers new high-throughput ways for transcript identification and quantification based on short reads, and has recently attracted great interest. The problem is usually modeled by a weighted splicing graph whose nodes…

Quantitative Methods · Quantitative Biology 2013-08-02 Alexandru I. Tomescu , Anna Kuosmanen , Romeo Rizzi , Veli Mäkinen

In many image processing tasks it occurs that pixels or blocks of pixels are missing or lost in only some channels. For example during defective transmissions of RGB images, it may happen that one or more blocks in one color channel are…

Image and Video Processing · Electrical Eng. & Systems 2022-09-19 Frank Sippel , Jürgen Seiler , André Kaup

We study the convolutional phase retrieval problem, of recovering an unknown signal $\mathbf x \in \mathbb C^n $ from $m$ measurements consisting of the magnitude of its cyclic convolution with a given kernel $\mathbf a \in \mathbb C^m $.…

Computation · Statistics 2019-10-08 Qing Qu , Yuqian Zhang , Yonina C. Eldar , John Wright

This paper considers the problem of recovering a one or two dimensional discrete signal which is approximately sparse in its discrete gradient from an incomplete subset of its discrete Fourier coefficients which have been corrupted with…

Numerical Analysis · Mathematics 2015-06-10 Clarice Poon
‹ Prev 1 8 9 10 Next ›