Sciweavers

980 search results - page 121 / 196
» Faster Possibility Detection by Combining Two Approaches
Sort
View
ICECCS
2007
IEEE
115views Hardware» more  ICECCS 2007»
15 years 10 months ago
On-the-fly model checking for C programs with extended CADP in FMICS-jETI
A current trend in the software engineering community is to integrate different tools in a friendly and powerful development environment for use by final users. This is also the c...
María-del-Mar Gallardo, Pedro Merino, Chris...
ASIACRYPT
2000
Springer
15 years 10 months ago
Cryptanalytic Time/Memory/Data Tradeoffs for Stream Ciphers
In 1980 Hellman introduced a general technique for breaking arbitrary block ciphers with N possible keys in time T and memory M related by the tradeoff curve TM2 = N2 for 1 T N. ...
Alex Biryukov, Adi Shamir
IADIS
2004
15 years 7 months ago
A CSP based ontology for a smart home
This paper addresses the problem of establishing collaboration between devices in a home environment, even when no previous knowledge is known or stored on the devices. It focuses...
José Ignacio Rendo Fernández, Iain W...
AUTOMATICA
2007
65views more  AUTOMATICA 2007»
15 years 6 months ago
Passivity-based designs for synchronized path-following
— We consider a formation control system where individual systems are controlled by a path-following design and the path variables are to be synchronized. We first show a passiv...
Ivar-André F. Ihle, Murat Arcak, Thor I. Fo...
BMCBI
2004
91views more  BMCBI 2004»
15 years 6 months ago
Improved hit criteria for DNA local alignment
The hit criterion is a key component of heuristic local alignment algorithms. It specifies a class of patterns assumed to witness a potential similarity, and this choice is decisi...
Laurent Noé, Gregory Kucherov