Sciweavers

110 search results - page 2 / 22
» New Upper Bounds for Maximum Satisfiability
Sort
View
CORR
2006
Springer
176views Education» more  CORR 2006»
13 years 5 months ago
On the Fingerprinting Capacity Under the Marking Assumption
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...
N. Prasanth Anthapadmanabhan, Alexander Barg, Ilya...
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
13 years 11 months ago
RNA Folding Including Pseudoknots: A New Parameterized Algorithm and Improved Upper Bound
Predicting the secondary structure of an RNA sequence is an important problem in structural bioinformatics. The general RNA folding problem, where the sequence to be folded may con...
Chunmei Liu, Yinglei Song, Louis W. Shapiro
JGT
2007
87views more  JGT 2007»
13 years 5 months ago
A new upper bound on the cyclic chromatic number
A cyclic colouring of a plane graph is a vertex colouring such that vertices incident with the same face have distinct colours. The minimum number of colours in a cyclic colouring...
Oleg V. Borodin, Hajo Broersma, Alexei N. Glebov, ...
MP
2006
137views more  MP 2006»
13 years 5 months ago
New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
There are many applications related to singly linearly constrained quadratic programs subjected to upper and lower bounds. In this paper, a new algorithm based on secant approximat...
Yu-Hong Dai, Roger Fletcher
TIT
2002
78views more  TIT 2002»
13 years 5 months ago
Improved upper bounds on sizes of codes
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...
Beniamin Mounits, Tuvi Etzion, Simon Litsyn