811 search results - page 19 / 163 » When Novelty Is Not Enough |
DCC
2005
IEEE
13 years 10 months ago
2005
IEEE
We derive an upper bound on the average MAP decoding error probability of random linear SW codes for arbitrary correlated stationary memoryless sources defined on Galois fields....
COMBINATORICS
2006
13 years 8 months ago
2006
We present a variation of James Propp's generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification...
CG
2007
Springer
13 years 8 months ago
2007
Springer
This paper describes the teaching of OpenGL shaders with hands-on a program called glman. Hands-on education is at its best when the students’ experimental feedback loop is very...
DM
1998
13 years 8 months ago
1998
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
RC
2007
13 years 8 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...