20 results for “Cramer-Rao bounds”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper presents a theoretical framework for multi-band localization in SIMO systems.
This paper derives Cramér-Rao lower bounds for cooperative MIMO integrated sensing and communication networks, considering position and velocity coupling in the Fisher information matrix.
This paper analyzes direction-of-arrival estimation using a tunable receive-side lossless reciprocal MiLAC combiner for antenna arrays and shows it can achieve the digital Cramér-Rao bound with fewer…
Tianyao Ma, Aimin Tang, Yin Xu, Qu Luo +2 more
This paper characterizes the parameter-estimation performance of AFDM-ISAC systems under practical model misspecification.
This paper improves the theoretical bounds for estimating discrete probability distributions using the $\ell_\infty$ norm, resolving several open questions in the field.
This paper investigates the design of dual-function radar-communication systems for massive MIMO systems using 1-bit DACs and ADCs, optimizing the transmit signal matrix for enhanced sensing performan…
The paper establishes information-theoretic lower bounds for stochastic optimization using low-bit gradients by reducing the problem to compressed Gaussian mean estimation, yielding sharp bounds on co…
The paper presents a novel design approach for movable antenna-enabled wireless sensing systems by jointly minimizing the Cramér-Rao bound and the maximum sidelobe level of the ambiguity function via…
The paper shows that repeated differentially private releases are not evaluated correctly by transcript length or cumulative privacy accounting, and develops a principle for local reconstruction risk.
This paper reviews models of inexact computational oracles in smooth continuous optimization and their implications for optimization algorithms.
This paper derives new linear programming bounds for q-ary (r,δ)-locally recoverable codes, improving upon previous bounds and applying to both linear and nonlinear codes.
The paper proves a stochastic comparison for Gaussian maxima, resolving the Weak Simplex Conjecture and proving the Simplex Mean Width Conjecture.
This paper proposes a novel algorithm SME-OFU that improves the regret bound for stochastic linear contextual bandits with bounded reward noise.
This paper proves convergence of belief propagation algorithms for multipath data association to a unique fixed point.