Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...
In this paper we examine the geometrically constrained optimization approach to localization with hybrid bearing (angle of arrival, AOA) and time difference of arrival (TDOA) sens...
Adrian N. Bishop, Baris Fidan, Kutluyil Dogancay, ...
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
An improved maximum likelihood estimator for ellipse fitting based on the heteroscedastic errors-in-variables (HEIV) regression algorithm is proposed. The technique significantly ...
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...