نتایج جستجو برای: tanner graph

تعداد نتایج: 199253  

Journal: :CoRR 2010
Ulas Ayaz Holger Rauhut

Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as l1-minimization find the sparsest solution to certain systems of equations. Random matrices have become a popular choice for the measurement matrix. Indeed, near-optimal uniform recovery results have been shown for such matrices. In this note we f...

Journal: :Computational Statistics & Data Analysis 2006
Ning Li Guoqi Qian Richard M. Huggins

A Bayesian latent variable model is proposed for studying household epidemics of infectious diseases in this paper. This model is more general and flexible than the commonly used chain binomial epidemicmodel. In particular, themodel allows for the heterogeneity of the infection transmission rates in related to the sizes and generations of the infectives. Moreover, the model assumes the availabi...

1990
ANDREW GELMAN

We analyze the effects of redistricting as revealed in the votes received by the Democratic and Republican candidates for state legislature. We develop measures of partisan bias and the responsiveness of the composition of the legislature to changes in statewide votes. Our statistical model incorporates a mixed hierarchical Bayesian and non-Bayesian estimation, requiring simulation along the li...

2015
Polly O'Rourke Gregory Colflesh

While the P600 is generally presumed to be a uniform response elicited consistently across individuals in specific syntactic contexts, Tanner and Van Hell (2014) showed evidence of distinct response profiles (N400 or P600 dominant) for syntactic violations across individuals. The current analysis used Tanner and Van Hell’s response-dominance index (RDI) to examine the impact of response dominan...

2011
Susan Fraiman

Austin,Jane. Mansfield Park. New York: The New American Library, 1964. Goldberg, S. L. Agents and Lives: Moral Thinking in Litn-ature. Cambridge: Cambridge UP, 1993. Harris,Jocelyn.]ane Austen's Art of Memory. Cambridge: Cambridge UP, 1989. MacIntyre, Alasdair. After Virtue:A Study in Moral Theory.Notre Dame: U of Notre Dame P, 1981. Said, Edward W Culture and Imperialism. New York: Alfred A. K...

2005
T J. Cole M. L. Donnet J. P. Stanfield

The protein-energy malnutrition classification schemes of Waterlow and McLaren, although similar in other respects, assess the weight-for-height of children in quite different ways. The drawbacks of their two methods are described, and an alternative method is presented which overcomes them. The new index is called weight/height2-for-age, and consists of the ratio weight/height2 expressed as a ...

2003
Ralf Koetter Pascal O. Vontobel

Codewords in finite covers of a Tanner graph G are characterized. Since iterative, locally operating decoding algorithms cannot distinguish the underlying graph G from any covering graph, these codewords, dubbed pseudo-codewords are directly responible for sub-optimal behavior of iterative decoding algorithms. We give a simple characterization of pseudocodewords from finite covers and show that...

2005
Richard S. Sutton Eddie J. Rafols Anna Koop

Temporal-difference (TD) networks have been proposed as a way of representing and learning a wide variety of predictions about the interaction between an agent and its environment (Sutton & Tanner, 2005). These predictions are compositional in that their targets are defined in terms of other predictions, and subjunctive in that that they are about what would happen if an action or sequence of a...

2006
George P. Yanev

where 0 < θ < 1, r is a positive integer and ar(x) = rx /(x− r)! Initially (1) was derived as the probability distribution of the number of customers served in a queuing system. It also appears in random trees and branching processes. More specifically, it is the distribution of the total progeny in a Galton-Watson process assuming Poisson reproduction, see Aldous [1] for recent applications. O...

Journal: :IEEE Trans. Communications 2003
Sarah J. Johnson Steven R. Weller

This paper extends the class of low-density paritycheck (LDPC) codes that can be algebraically constructed. We present regular LDPC codes based on resolvable Steiner 2-designs which have Tanner graphs free of four-cycles. The resulting codes are -regular or -regular for any value of and for a flexible choice of code lengths.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید