Sciweavers

2312 search results - page 7 / 463
» The complexity of estimating min-entropy
Sort
View
WAIM
2010
Springer
13 years 6 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
TWC
2008
156views more  TWC 2008»
13 years 8 months ago
Low-Complexity Map Channel Estimation for Mobile MIMO-OFDM Systems
Abstract-- This paper presents a reduced-complexity maximum a posteriori probability (MAP) channel estimator with iterative data detection for orthogonal frequency division multipl...
Jie Gao, Huaping Liu
TIP
1998
97views more  TIP 1998»
13 years 8 months ago
Estimation of shape of binary polygonal object from scattered field
—We present a method of estimating the shape of a weakly scattering binary convex polygonal object from the backscattered field. We use the concept scattering centers where it h...
A. Buvaneswari, Prabhakar S. Naidu
ICC
2007
IEEE
121views Communications» more  ICC 2007»
14 years 2 months ago
Low Complexity Adaptive Turbo Frequency-Domain Channel Estimation for Single-Carrier Multi-User Detection with Unknown Co-Channe
—Adaptive Turbo frequency-domain channel estimation is investigated for single-carrier (SC) multi-user detection in the presence of unknown co-channel interference (CCI). We prop...
Ye Wu, Xu Zhu, Asoke K. Nandi
TSP
2010
13 years 3 months ago
On entropy rate for the complex domain and its application to i.i.d. sampling
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
Wei Xiong, Hualiang Li, Tülay Adali, Yi-Ou Li...