activity
20162025
most citedSuper-resolution of generalized spikes and spectra of confluent Vandermonde matrices

6 citations · 7 across the 7 of their papers we have counts for

collaborators

7 papers

math.NA2025

Selecting Optimal Sampling Rate for Stable Super-Resolution

Nuha Diab

We investigate the recovery of nodes and amplitudes from noisy frequency samples in spike train signals, also known as the super-resolution (SR) problem. When the node separation f…

math.NA2024

Spectral Properties of Infinitely Smooth Kernel Matrices in the Single Cluster Limit, with Applications to Multivariate Super-Resolution

Nuha Diab, Dmitry Batenkov

We study the spectral properties of infinitely smooth multivariate kernel matrices when the nodes form a single cluster. We show that the geometry of the nodes plays an important r…

math.NA2023

On the accuracy of Prony's method for recovery of exponential sums with closely spaced exponents

Rami Katz, Nuha Diab, Dmitry Batenkov

In this paper we establish accuracy bounds of Prony's method (PM) for recovery of sparse measures from incomplete and noisy frequency measurements, or the so-called problem of supe…

math.NA2022★ 1 cited

Decimated Prony's Method for Stable Super-resolution

Rami Katz, Nuha Diab, Dmitry Batenkov

We study recovery of amplitudes and nodes of a finite impulse train from noisy frequency samples. This problem is known as super-resolution under sparsity constraints and has numer…

math.NA2022★ 6 cited

Super-resolution of generalized spikes and spectra of confluent Vandermonde matrices

Dmitry Batenkov, Nuha Diab

We study the problem of super-resolution of a linear combination of Dirac distributions and their derivatives on a one-dimensional circle from noisy Fourier measurements. Following…

cs.LG2017

Non-Adaptive Randomized Algorithm for Group Testing

Nader H. Bshouty, Nuha Diab, Shada R. Kawar +1

We study the problem of group testing with a non-adaptive randomized algorithm in the random incidence design (RID) model where each entry in the test is chosen randomly independen…

cs.DM2016

Enumerating all the Irreducible Polynomials over Finite Field

Nader H. Bshouty, Nuha Diab, Shada R. Kawar +1

In this paper we give a detailed analysis of deterministic and randomized algorithms that enumerate any number of irreducible polynomials of degree over a finite field and thei…