Sciweavers

437 search results - page 24 / 88
» Randomized Lattice Decoding
Sort
View
TCOM
2008
118views more  TCOM 2008»
14 years 10 months ago
Performance analysis for collaborative decoding with least-reliable-bits exchange on AWGN channels
Collaborative decoding is an approach that can achieve diversity and combining gain by exchanging decoding information among a cluster of physically separated receivers. On AWGN ch...
Xin Li, Tan F. Wong, John M. Shea
ECCV
2006
Springer
16 years 1 months ago
Tracking Dynamic Near-Regular Texture Under Occlusion and Rapid Movements
We present a dynamic near-regular texture (NRT) tracking algorithm nested in a lattice-based Markov-Random-Field (MRF) model of a 3D spatiotemporal space. One basic observation use...
Wen-Chieh Lin, Yanxi Liu
80
Voted
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 1 days ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
CORR
2010
Springer
79views Education» more  CORR 2010»
14 years 12 months ago
Random Topologies and the emergence of cooperation: the role of short-cuts
We present a detailed study about the role of the short-cuts of a network in promoting the emergence of cooperation in a population of agents playing the Prisoner's Dilemma Ga...
Daniele Vilone, Angel Sánchez, Jesús...
TIT
2008
164views more  TIT 2008»
14 years 11 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung