Sciweavers

4355 search results - page 90 / 871
» Increasing Kolmogorov Complexity
Sort
View
CORIA
2009
13 years 10 months ago
Les traces d'interactions humaines, un nouveau domaine d'application pour la RI
The socio-cognitve study of human computer-mediated interactions can be done through the analysis of increasingly larger and complex corpora composed of audio-video recording and i...
Gregory Dyke, Michel Beigbeder, Kristine Lund, Jea...
ESWS
2010
Springer
13 years 10 months ago
A Software Tool for Visualizing, Managing and Eliciting SWRL Rules
SWRL rule are increasingly being used to represent knowledge on the Semantic Web. As these SWRL rule bases grows larger, managing the resulting complexity can become a challenge. D...
Saeed Hassanpour, Martin J. O'Connor, Amar K. Das
JAPLL
2006
97views more  JAPLL 2006»
13 years 8 months ago
Model checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
Martin Lange
DAM
2007
77views more  DAM 2007»
13 years 8 months ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
CTRSA
2010
Springer
212views Cryptology» more  CTRSA 2010»
14 years 3 months ago
Fault Attacks Against emv Signatures
At ches 2009, Coron, Joux, Kizhvatov, Naccache and Paillier (cjknp) exhibited a fault attack against rsa signatures with partially known messages. This attack allows factoring the ...
Jean-Sébastien Coron, David Naccache, Mehdi...