Sciweavers

1945 search results - page 72 / 389
» Speeding up Serpent
Sort
View
IEICET
2008
76views more  IEICET 2008»
14 years 11 months ago
All Pairings Are in a Group
In this paper, we suggest that all pairings be in a group from an abstract angle. According to our results, we can define some new pairings with short Miller loops and hence speed ...
Changan Zhao, Fangguo Zhang, Jiwu Huang
IPL
2006
103views more  IPL 2006»
14 years 11 months ago
On the cost of searching signature trees
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
Yangjun Chen
ENTCS
2007
101views more  ENTCS 2007»
14 years 11 months ago
Compressing Propositional Refutations
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large p...
Hasan Amjad
CORR
2004
Springer
76views Education» more  CORR 2004»
14 years 11 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
ATVA
2011
Springer
295views Hardware» more  ATVA 2011»
13 years 11 months ago
Parallel Nested Depth-First Searches for LTL Model Checking
Even though the well-known nested-depth first search algorithm for LTL model checking provides good performance, it cannot benefit from the recent advent of multi-core computers....
Sami Evangelista, Laure Petrucci, Samir Youcef