3208 search results - page 145 / 642 » A Lower Bound for Primality |
175
click to vote
NIPS
2008
15 years 7 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
134
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Lattice reduction-aided decoding enables significant complexity saving and near-optimum performance in multi-input multi-output (MIMO) communications. However, its remarkable perfo...
187
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
186
click to vote
AAAI
1996
15 years 7 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
197
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...