7055 search results - page 122 / 1411 » Some New 4-Designs |
162
click to vote
TIT
2002
15 years 6 months ago
2002
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is t...
184
click to vote
JMLR
2010
15 years 1 months ago
2010
There is a growing interest in building probabilistic models with high order potentials (HOPs), or interactions, among discrete variables. Message passing inference in such models...
120
click to vote
IJMTM
2000
15 years 6 months ago
2000
A reconfigurable manufacturing system (RMS) is designed for rapid adjustment of production capacity and functionality in response to new market conditions and new process technolo...
151
click to vote
ENTCS
2002
15 years 6 months ago
2002
We give a short description of Hybrid, a new tool for interactive theorem proving, s introduced in [4]. It provides a form of Higher Order Abstract Syntax (HOAS) combined consiste...
168
click to vote
TIT
1998
15 years 6 months ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...