We analyze the convergence of randomized trace estimators. Starting at 1989, several algorithms have been proposed for estimating the trace of a matrix by 1 M M i=1 zT i Azi, where...
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
The received signal strength (RSS)-based approach to wireless localization offers the advantage of low cost and easy implementability. To circumvent the nonconvexity of the convent...
Wentao Robin Ouyang, Albert Kai-Sun Wong, Chin-Tau...
Abstract-- the paper presents a possibility formulation of oneparameter estimation that unifies some usual probability formulations. Point and confidence interval estimation are un...
The huge size of online social networks (OSNs) makes it prohibitively expensive to precisely measure any properties which require the knowledge of the entire graph. To estimate the...
Abstract. A comparison between time and frequency domain TOA estimators compliant with the 802.15.4a Standard has been made. The time domain estimator is done in two stages. One ha...
We establish the Stein phenomenon in the context of two-step, monotone incomplete data drawn from Np+q(µ, Σ), a multivariate normal population with mean µ and covariance matrix...
This paper develops and compares the maximum a posteriori (MAP) and minimum mean-square error (MMSE) estimators for spherically contoured multivariate Laplace random vectors in add...
Summaries of massive data sets support approximate query processing over the original data. A basic aggregate over a set of records is the weight of subpopulations specified as a ...
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...