Sciweavers

215 search results - page 28 / 43
» The asymptotic number of binary codes and binary matroids
Sort
View
CORR
2006
Springer
110views Education» more  CORR 2006»
14 years 11 months ago
Multiple Access Channels with State Information Known at Some Encoders
We consider a multiple access channel (MAC) with channel state information (CSI) non-causally known at some encoders. For simplicity of exposition, we focus on a two-encoder model...
Shivaprasad Kotagiri, J. Nicholas Laneman
TIT
2002
101views more  TIT 2002»
14 years 11 months ago
Large-system performance analysis of blind and group-blind multiuser receivers
We present a large-system performance analysis of blind and group-blind multiuser detection methods. In these methods, the receivers are estimated based on the received signal samp...
Junshan Zhang, Xiaodong Wang
ICDM
2009
IEEE
197views Data Mining» more  ICDM 2009»
14 years 9 months ago
A Linear-Time Graph Kernel
The design of a good kernel is fundamental for knowledge discovery from graph-structured data. Existing graph kernels exploit only limited information about the graph structures bu...
Shohei Hido, Hisashi Kashima
SIGIR
2010
ACM
15 years 3 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
DCC
2005
IEEE
15 years 11 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...