Sciweavers

13603 search results - page 2674 / 2721
» On the Complexity of Computing Treelength
Sort
View
CSCLP
2008
Springer
13 years 12 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
13 years 12 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...
DNA
2008
Springer
13 years 12 months ago
A Simple DNA Gate Motif for Synthesizing Large-Scale Circuits
The prospects of programming molecular systems to perform complex autonomous tasks has motivated research into the design of synthetic biochemical circuits. Of particular interest ...
Lulu Qian, Erik Winfree
ESORICS
2008
Springer
13 years 12 months ago
Symmetric Key Approaches to Securing BGP - A Little Bit Trust Is Enough
The Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol that connects autonomous systems (ASes). Despite its importance for the Internet infrastructure, BGP...
Bezawada Bruhadeshwar, Sandeep S. Kulkarni, Alex X...
FASE
2008
Springer
13 years 12 months ago
Automated Analysis of Permission-Based Security Using UMLsec
Abstract. To guarantee the security of computer systems, it is necessary to define security permissions to restrict the access to the systems' resources. These permissions enf...
Jan Jürjens, Jörg Schreck, Yijun Yu
« Prev « First page 2674 / 2721 Last » Next »