Results 1 - 10 of 355

Codeword Distribution for Frequency Sensitive Competitive Learning with One Dimensional Input Data

by Aristides S. Galanopoulos, Stanley C. Ahalt - IEEE TRANS. NEURAL NETWORKS , 1995
"... We study the codeword distribution for a consciense type competitive learning algorithm, Frequency Sensitive Competitive Learning (FSCL), using one dimensional input data. We prove that the asymptotic codeword density in the limit of large number of codewords is given by a power law of the form Q(x) ..."
Abstract - Add to MetaCart
We study the codeword distribution for a consciense type competitive learning algorithm, Frequency Sensitive Competitive Learning (FSCL), using one dimensional input data. We prove that the asymptotic codeword density in the limit of large number of codewords is given by a power law of the form Q

A bayesian hierarchical model for learning natural scene categories

by Li Fei-fei - In CVPR , 2005
"... We propose a novel approach to learn and recognize natural scene categories. Unlike previous work [9, 17], it does not require experts to annotate the training set. We represent the image of a scene by a collection of local regions, denoted as codewords obtained by unsupervised learning. Each region ..."
Abstract - Cited by 948 (15 self) - Add to MetaCart
region is represented as part of a “theme”. In previous work, such themes were learnt from hand-annotations of experts, while our method learns the theme distributions as well as the codewords distribution over the themes without supervision. We report satisfactory categorization performances on a large

Approximation of DAC codeword distribution for equiprobable binary sources along proper decoding path

by Yong Fang - IEEE Trans. Inf. Theory, submitted, available online: http://arxiv.org/abs/1009.5257v1. October
"... ar ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract not found

The benefits of coding over routing in a randomized setting

by Tracey Ho, Ralf Koetter, Muriel Médard, David R. Karger, Michelle Effros - In Proceedings of 2003 IEEE International Symposium on Information Theory , 2003
"... Abstract — We present a novel randomized coding approach for robust, distributed transmission and compression of information in networks. We give a lower bound on the success probability of a random network code, based on the form of transfer matrix determinant polynomials, that is tighter than the ..."
Abstract - Cited by 361 (44 self) - Add to MetaCart
exponentially with the number of codeword bits. We demonstrate the advantage of randomized coding over routing for distributed transmission in rectangular grid networks by giving, in terms of the relative grid locations of a source-receiver pair, an upper bound on routing success probability that is exceeded

Collusion-Secure Fingerprinting for Digital Data

by Dan Boneh, James Shaw - IEEE Transactions on Information Theory , 1996
"... This paper discusses methods for assigning codewords for the purpose of fingerprinting digital data (e.g., software, documents, and images). Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy and trac ..."
Abstract - Cited by 353 (1 self) - Add to MetaCart
This paper discusses methods for assigning codewords for the purpose of fingerprinting digital data (e.g., software, documents, and images). Fingerprinting consists of uniquely marking and registering each copy of the data. This marking allows a distributor to detect any unauthorized copy

over generalized codewords of LDGM codes

by Martin J. Wainwright, Elitza Maneva
"... Abstract — We describe message-passing and decimation approaches for lossy source coding using low-density generator matrix (LDGM) codes. In particular, this paper addresses the problem of encoding a Bernoulli ( ) source: for randomly generated LDGM codes with suitably irregular degree distributions ..."
Abstract - Add to MetaCart
distributions, our methods yield performance very close to the rate distortion limit over a range of rates. Our approach is inspired by the survey propagation (SP) algorithm, originally developed by Mézard et al. [1] for solving random satisfiability problems. Previous work by Maneva et al. [2] shows how SP can

Distributed space-time coding in wireless relay networks,”IEEE Trans.

by Frédérique Oggier , Babak Hassibi - on Wireless Communications, , 2006
"... Abstract In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver or relays. The coding scheme uses distributed space-time coding, that is, the relay nodes cooperate to encode the transmitted signal ..."
Abstract - Cited by 225 (16 self) - Add to MetaCart
Abstract In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver or relays. The coding scheme uses distributed space-time coding, that is, the relay nodes cooperate to encode the transmitted

Speech recognition using an enhanced FVQ based on codeword dependent distribution normalization and codeword weighting by fuzzy objective function

by Hwan Jin Choi, Yung Hwan Oh - in Proceedings of the International Conference on Spoken Language Processing (ICSLP , 1996
"... The paper presents a new variant of parameter estimation methods for discrete hidden Markov models(HMM) in speech recognition. This method makes use of a codeword dependent distribution normalization(CDDN) and a distance weighting by fuzzy contribution in dealing with the problems of robust state mo ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
The paper presents a new variant of parameter estimation methods for discrete hidden Markov models(HMM) in speech recognition. This method makes use of a codeword dependent distribution normalization(CDDN) and a distance weighting by fuzzy contribution in dealing with the problems of robust state

Codeword Optimization for Uplink CDMA Dispersive Channels

by Dimitrie C. Popescu, Senior Member, Christopher Rose, Senior Member - IEEE Transactions on Wireless Communications , 2005
"... Abstract—We present the application of greedy interference avoidance methods to codeword optimization in the uplink of a code division multiple access (CDMA) system in which the channel between a given user and the base station receiver is assumed known and stable for the duration of the transmissio ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
of the transmission. Repeated application of greedy interference avoidance monotonically increases sum capacity and yields an optimal codeword ensemble that satisfies a simultaneous water-filling distribution. However, algorithms for codeword optimization based on the greedy interference avoidance procedure

Integer maxima in power envelopes of Golay codewords

by Michael W. Cammarano, Meredith L. Walker, Michael W. Cammarano, Meredith L. Walker , 1999
"... This paper examines the distribution of integer peaks amoung Golay cosets in Z2 and Z4. It will prove that the envelope power of at least one element of every Golay coset of Z4 of length 2m (for m-even) will have a maximum at exactly 2m+1. Similarly, it will be proven that one element of every Golay ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
This paper examines the distribution of integer peaks amoung Golay cosets in Z2 and Z4. It will prove that the envelope power of at least one element of every Golay coset of Z4 of length 2m (for m-even) will have a maximum at exactly 2m+1. Similarly, it will be proven that one element of every
Results 1 - 10 of 355