Sciweavers

5785 search results - page 370 / 1157
» Approximability of Probability Distributions
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
On efficient soft-input soft-output encoding of convolutional codes
We study efficient algorithms for soft-input soft-output (SISO) encoding of convolutional codes. While the BCJR algorithm has been suggested for SISO encoding, we show that a for...
Andreas Winkelbauer, Gerald Matz
ICASSP
2011
IEEE
14 years 10 months ago
CLT for eigen-inference methods in cognitive radios
This article provides a central limit theorem for a consistent estimator of the population eigenvalues of a class of sample covariance matrices. An exact expression as well as an ...
Jianfeng Yao, Romain Couillet, Jamal Najim, Eric M...
KDD
1998
ACM
145views Data Mining» more  KDD 1998»
15 years 10 months ago
Aggregation of Imprecise and Uncertain Information for Knowledge Discovery in Databases
We consider the problem of aggregation for uncertain and imprecise data. For such data, we define aggregation operators and use them to provide information on properties and patte...
Sally I. McClean, Bryan W. Scotney, Mary Shapcott
TC
2008
15 years 6 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
MOBIHOC
2002
ACM
16 years 5 months ago
Message-optimal connected dominating sets in mobile ad hoc networks
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder