197 search results - page 11 / 40 » New Upper Bounds for Ramsey Numbers |
STACS
2001
Springer
14 years 9 days ago
2001
Springer
Abstract. Ordered binary decision diagrams (OBDDs) nowadays belong to the most common representation types for Boolean functions. Although they allow important operations such as s...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
d Abstract) Frederic Bihan∗ Joel Gomez† Andrew Niles‡ J. Maurice Rojas§ January 24, 2007 Rojas dedicates this paper to his friend, Professor Tien-Yien Li. Consider real biv...
JCT
2007
13 years 7 months ago
2007
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For several dimensions it yields improved upper bounds including some new bounds on...
TMI
2010
13 years 6 months ago
2010
Abstract—The pinhole camera in single photon emission computed tomography (SPECT) has an inherent trade-off between resolution and sensitivity. Recent systems overcome this to so...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...