Sciweavers

7421 search results - page 1161 / 1485
» In search of dependable design
Sort
View
CADE
2011
Springer
14 years 6 months ago
Deciding Security for Protocols with Recursive Tests
Abstract. Security protocols aim at securing communications over public networks. Their design is notoriously difficult and error-prone. Formal methods have shown their usefulness ...
Mathilde Arnaud, Véronique Cortier, St&eacu...
CHES
2011
Springer
298views Cryptology» more  CHES 2011»
14 years 6 months ago
spongent: A Lightweight Hash Function
This paper proposes spongent – a family of lightweight hash functions with hash sizes of 88 (for preimage resistance only), 128, 160, 224, and 256 bits based on a sponge construc...
Andrey Bogdanov, Miroslav Knezevic, Gregor Leander...
CIKM
2011
Springer
14 years 6 months ago
Fact-based question decomposition for candidate answer re-ranking
Factoid questions often contain one or more assertions (facts) about their answers. However, existing question-answering (QA) systems have not investigated how the multiple facts ...
Aditya Kalyanpur, Siddharth Patwardhan, Branimir B...
CIKM
2011
Springer
14 years 6 months ago
Estimating selectivity for joined RDF triple patterns
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
Hai Huang 0003, Chengfei Liu

Publication
165views
14 years 10 days ago
Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault
In this paper, we propose a task scheduling algorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore processo...
Shohei Gotoda, Naoki Shibata and Minoru Ito
« Prev « First page 1161 / 1485 Last » Next »