Sciweavers

1058 search results - page 24 / 212
» It's Doomed; We Can Prove It
Sort
View
CSR
2010
Springer
14 years 1 months ago
Zigzags in Turing Machines
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of r...
Anahí Gajardo, Pierre Guillon
CHES
2008
Springer
135views Cryptology» more  CHES 2008»
13 years 12 months ago
Attack and Improvement of a Secure S-Box Calculation Based on the Fourier Transform
At CHES 2006, a DPA countermeasure based on the Fourier Transform was published. This generic countermeasure aims at protecting from DPA any S-box calculation used in symmetric cry...
Jean-Sébastien Coron, Christophe Giraud, Em...
AAAI
2010
13 years 11 months ago
Knowledge Compilation in the Modal Logic S5
In this paper, we study the knowledge compilation task for propositional epistemic logic S5. We first extend many of the queries and transformations considered in the classical kn...
Meghyn Bienvenu, Hélène Fargier, Pie...
CI
2007
45views more  CI 2007»
13 years 9 months ago
Market-Based Approaches to Optimization
Abstract. We present a general discussion of what constitutes a marketoriented approach to optimization. We demonstrate how a general framework can be used to conceptually improve ...
Maria Karlsson, Fredrik Ygge, Arne Andersson
MFCS
2010
Springer
13 years 8 months ago
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
Kenya Ueno