[PDF] Top 20 On Lower Bounds for Non Standard Deterministic Estimation

... its deterministic part provides a tighter LB than the corresponding MLB deriving from (14), however at the expense of an increased computational cost (see ...look for the best possible trade-off between ... Voir le document complet

... of estimation problems where non-linear transformations of the LR can be used to derive new lower bounds on the ...of estimation problems characterized by a p.d.f. p (x; θ) for ... Voir le document complet

... and lower bounds for the true algebraic connectivity at each ...both bounds converge to the true algebraic connec- tivity, with a convergence speed no slower than ...Connectivity ... Voir le document complet

... address for the first time the deterministic convergecast problem with labeling schemes in arbitrary networks subject to ...propose lower and upper bounds in terms of time and labeling ... Voir le document complet

... available for parameter estimation, any accurate MSE lower bound must take into account this initial statistical condition- ...any lower bound with statistical conditioning is straightforward ... Voir le document complet

... paper, non standard deterministic parameters estimation is considered, ...unknown deterministic parameters results from the marginalization of a joint ...known deterministic ... Voir le document complet

... Most interestingly, the NDA approaches share the advantage of not impinging on the whole throughput of the system (high spectral efficiency). However, they usually exhibit very poor estimation performance in the low ... Voir le document complet

... (d) ρ = 25 : σ1 = 1 and σi = p24/(n − 1) for i > 1. Results are given in Table 4.1, rounded to four digits. We write 1, as opposed to 1.0000, when the empirical probability is exactly 1, i.e., when all 10 5 ... Voir le document complet

... (d) ρ = 25 : σ 1 = 1 and σ i = p24/(n − 1) for i > 1. Results are given in Table 4.1, rounded to four digits. We write 1, as opposed to 1.0000, when the empirical probability is exactly 1, i.e., when all 10 5 ... Voir le document complet

... obtained for the sup-norm ...density estimation is sup-norm ...established for ”moderately” ill posed problem, so we detail only results in papers studying that type of ... Voir le document complet

... existing bounds by exploring the unbiasedness assumptions, from its weakest formulation (CRB) to its strongest formulation ...mentioned lower bounds can be computed via the ...test. For the ... Voir le document complet

... many deterministic estimation problems, the probability density function ...unknown deterministic parame- ters results from the marginalization of a joint ...any standard lower bound on ... Voir le document complet

... inspiration for further works in mathematical statistics having concrete computational ...applications. For example, the unbiased estimation of such quantity for small sample appears to be an ... Voir le document complet

... (FIM) for complex elliptically distributed data, we provide a simple expression of the FIM with the two data sets ...FIM for the deterministic part of the model can be unbounded, while the FIM ... Voir le document complet

... the standard knapsack problem (in the Turing model) is in ...the standard knapsack problem is NP-complete (there is a similar remark in ...since for any input size, a polynomial-time real machine can ... Voir le document complet

... DOA estimation for noncircular signals by considering algo- rithms and performance ...the standard MUSIC ...the standard MUSIC algorithm as well, but the performance gain is prominent ... Voir le document complet

... derives lower bounds on the mean- square error (MSE) for the estimation of a covariance matrix , using samples k = 1; ...assumptions for . First, we assume that is a ... Voir le document complet

... a standard technique in discrete and computational geometry, with many combinatorial and algorithmic ...upper bounds for discrepancy of set systems, LP rounding, range searching, streaming ... Voir le document complet

... a lower bound on the routing ratio on L ∞ -Delaunay ...a lower bound on the routing ratio of any deterministic k-local routing algorithm on the L 1 - and L ∞ -Delaunay ... Voir le document complet

... a lower bound is valid, we need to prove that it is valid for all deterministic ...assignments for all items is the same as considering all ...nding lower bounds as a game and ... Voir le document complet