Related papers: Sign retrieval in spaces of variable bandwidth
It is shown that bandwidth estimation in packet networks can be viewed in terms of min-plus linear system theory. The available bandwidth of a link or complete path is expressed in terms of a {\em service curve}, which is a function that…
We introduce a continuous domain framework for the recovery of a planar curve from a few samples. We model the curve as the zero level set of a trigonometric polynomial. We show that the exponential feature maps of the points on the curve…
Knowing the largest rate at which data can be sent on an end-to-end path such that the egress rate is equal to the ingress rate with high probability can be very practical when choosing transmission rates in video streaming or selecting…
In a previous paper, the author constructed frames and oversampling formulas for band-limited functions, in the framework of the theory of shift-invariant spaces. In this article we study the problem of recovering missing samples. We find a…
In this paper, we investigate the stochastic contextual bandit with general function space and graph feedback. We propose an algorithm that addresses this problem by adapting to both the underlying graph structures and reward gaps. To the…
The bandwidth of a graph is the labeling of vertices with minimum maximum edge difference. For many graph families this is NP-complete. A classic result computes the bandwidth for the hypercube. We generalize this result to give sharp lower…
A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…
Heat diffusion processes have found wide applications in modelling dynamical systems over graphs. In this paper, we consider the recovery of a $k$-bandlimited graph signal that is an initial signal of a heat diffusion process from its…
A method for the detection of changes in the expectation in univariate sequences is provided. Moving sum processes are studied. These rely on the selection of a tuning bandwidth. Here, a framework to overcome bandwidth selection is…
We introduce a new concept of variable bandwidth that is based on the truncation of Wilson expansions. For this model we derive both (nonuniform) sampling theorems, the complete reconstruction of $f$ from its samples, and necessary density…
In this work, we investigate the sampling and reconstruction of spectrally $s$-sparse bandlimited graph signals governed by heat diffusion processes. We propose a random space-time sampling regime, referred to as {randomized} dynamical…
Phase retrieval refers to algorithmic methods for recovering a signal from its phaseless measurements. Local search algorithms that work directly on the non-convex formulation of the problem have been very popular recently. Due to the…
Signal detection in environments with unknown signal bandwidth and time intervals is a fundamental problem in adversarial and spectrum-sharing scenarios. This paper addresses the problem of detecting signals occupying unknown degrees of…
Suppose that we observe noisy linear measurements of an unknown signal that can be modeled as the sum of two component signals, each of which arises from a nonlinear sub-manifold of a high dimensional ambient space. We introduce SPIN, a…
We demonstrate the applicability of bandwidth and wavefront reduction algorithms to static variable ordering. In symbolic model checking event locality plays a major role in time and memory usage. For example, in Petri nets event locality…
In this work, we study early-warning signs for stochastic partial differential equations (SPDEs), where the linearization around a steady state has continuous spectrum. The studied warning sign takes the form of qualitative changes in the…
The Phase Retrieval problem is dealt with for the challenging case where just a single set of (phaseless) radiated field data is available. In particular, even still emulating the solution of crosswords puzzles, we provide decisive…
We consider the phase retrieval problem for signals that belong to a union of subspaces. We assume that amplitude measurements of the signal of length $n$ are observed after passing it through a random $m \times n$ measurement matrix. We…
We consider the geometry associated to the ambiguities of the one-dimensional Fourier phase retrieval problem for vectors in ${\mathbb C}^{N+1}$. Our first result states that the space of signals has a finite covering (which we call the…
We address the problem of estimating time and frequency shifts of a known waveform in the presence of multiple measurement vectors (MMVs). This problem naturally arises in radar imaging and wireless communications. Specifically, a signal…