Sciweavers

539 search results - page 4 / 108
» An Improved Upper Bound for SAT
Sort
View
CORR
2004
Springer
76views Education» more  CORR 2004»
13 years 7 months ago
Improved Upper Bound for the Redundancy of Fix-Free Codes
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...
Sergey Yekhanin
WABI
2007
Springer
133views Bioinformatics» more  WABI 2007»
14 years 1 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
EUROPAR
2004
Springer
14 years 25 days ago
Improving Data Cache Performance via Address Correlation: An Upper Bound Study
Address correlation is a technique that links the addresses that reference the same data values. Using a detailed source-code level analysis, a recent study [1] revealed that diffe...
Peng-fei Chuang, Resit Sendag, David J. Lilja
SACRYPT
2000
Springer
107views Cryptology» more  SACRYPT 2000»
13 years 11 months ago
Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions
It has recently been shown that when m > 1 2 n - 1, the nonlinearity Nf of an mth-order correlation immune function f with n variables satisfies the condition of Nf 2n-1 - 2m ,...
Yuliang Zheng, Xian-Mo Zhang
STACS
1999
Springer
13 years 11 months ago
Upper Bounds for Vertex Cover Further Improved
tended abstract of this work appears in the proceedings of the 16th Symposium on Theoretical Aspects of Computer Science (STACS’99), Springer, LNCS, held in Trier, Fed. Rep. of G...
Rolf Niedermeier, Peter Rossmanith