Sciweavers

537 search results - page 23 / 108
» A new upper bound for 3-SAT
Sort
View
JCT
2011
106views more  JCT 2011»
13 years 3 months ago
Bounds for separating hash families
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type. Key...
Marjan Bazrafshan, Tran van Trung
JCT
2007
134views more  JCT 2007»
13 years 8 months ago
Improved Delsarte bounds for spherical codes in small dimensions
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...
Florian Pfender
WCET
2007
13 years 9 months ago
Data-Flow Based Detection of Loop Bounds
To calculate the WCET of a program, safe upper bounds on the number of loop iterations for all loops in the program are needed. As the manual annotation of all loops with such bou...
Christoph Cullmann, Florian Martin
EPEW
2007
Springer
14 years 2 months ago
Closed Form Absorption Time Bounds
We consider a class of Markov chains known for its closed form transient and steady-state distributions. We show that some absorbing chains can be also seen as members of this clas...
Ana Busic, Nihal Pekergin
TIT
2010
103views Education» more  TIT 2010»
13 years 3 months ago
Performance bounds for erasure, list and decision feedback schemes with linear block codes
A message independence property and some new performance upper bounds are derived in this work for erasure, list and decision-feedback schemes with linear block codes transmitted ...
Eran Hof, Igal Sason, Shlomo Shamai