相关论文: Improved Bounds for Two Query Adaptive Bitprobe Sc…
We propose several new lower bounds on the bandwidth costs of MDS convertible codes using a linear-algebraic framework. The derived bounds improve previous results in certain parameter regimes and match the bandwidth cost of the…
We present a fully adaptive multiresolution scheme for spatially one-dimensional quasilinear strongly degenerate parabolic equations with zero-flux and periodic boundary conditions. The numerical scheme is based on a finite volume…
Multi-element wings are popular in the aerospace community due to their high lift performance. Turbulent flow simulations of these configurations require very fine mesh spacings especially near the walls, thereby making use of a boundary…
We report an experimental realization of adaptive Bayesian quantum state tomography for two-qubit states. Our implementation is based on the adaptive experimental design strategy proposed in [F.Husz\'ar and N.M.T.Houlsby, Phys.Rev.A 85,…
A major application for atomic ensembles consists of a quantum memory for light, in which an optical state can be reversibly converted to a collective atomic excitation on demand. There exists a well-known fundamental bound on the storage…
Achieving ultimate bounds in estimation processes is the main objective of quantum metrology. In this context, several problems require measurement of multiple parameters by employing only a limited amount of resources. To this end,…
Highly directional mmWave/THz links require rapid beam alignment, yet exhaustive codebook sweeps incur prohibitive training overhead. This letter proposes a sensing-assisted adaptive probing policy that maps multimodal sensing…
A scheme for locally adaptive bandwidth selection is proposed which sensitively shrinks the bandwidth of a kernel estimator at lowest density regions such as the support boundary which are unknown to the statistician. In case of a…
We investigate schemes for Hamiltonian parameter estimation of a two-level system using repeated measurements in a fixed basis. The simplest (Fourier based) schemes yield an estimate with a mean square error (MSE) that decreases at best as…
We consider the following problem: Given a set S of at most n elements from a universe of size m, represent it in memory as a bit string so that membership queries of the form "Is x in S?" can be answered by making at most t probes into the…
Computing lower and upper bounds on the competitive ratio of online algorithms is a challenging question: For a minimization combinatorial problem, proving a competitive ratio for a given algorithm leads to an upper bound. However computing…
Two-level designs are widely used for screening experiments where the goal is to identify a few active factors which have major effects. Orthogonal two-level designs in which all factors are level-balance and each of the four level…
Let S be a finite, ordered alphabet, and let x = x_1 x_2 ... x_n be a string over S. A "secondary index" for x answers alphabet range queries of the form: Given a range [a_l,a_r] over S, return the set I_{[a_l;a_r]} = {i |x_i \in [a_l;…
We consider a memory allocation problem that can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. A 3/2-approximation algorithm and an NP-hardness proof for this problem…
This study presents constructions of the space-time Conservation Element and Solution Element (CESE) methods to accommodate adaptive unstructured quadrilateral meshes. Subsequently, a novel algorithm is devised to effectively manage the…
Storage architectures ranging from minimum bandwidth regenerating encoded distributed storage systems to declustered-parity RAIDs can be designed using dense partial Steiner systems in order to support fast reads, writes, and recovery of…
The multi-access variant of the coded caching problem with $N$ files, $K$ users and $K$ caches, where each user has access to $L$ neighbouring caches in a cyclic wrap-around manner, is considered. A cut-set based lower bound on the optimal…
A new gradient-based adaptive sampling method is proposed for design of experiments applications which balances space filling, local refinement, and error minimization objectives while reducing reliance on delicate tuning parameters. High…
A method for bounding the rate of bit-stuffing encoders for 2-D constraints is presented. Instead of considering the original encoder, we consider a related one which is quasi-stationary. We use the quasi-stationary property in order to…
In this paper we study the adaptive prefix coding problem in cases where the size of the input alphabet is large. We present an online prefix coding algorithm that uses $O(\sigma^{1 / \lambda + \epsilon}) $ bits of space for any constants…