Sciweavers

27692 search results - page 53 / 5539
» Where is ...
Sort
View
FSE
2011
Springer
268views Cryptology» more  FSE 2011»
13 years 7 days ago
Cryptanalysis of PRESENT-Like Ciphers with Secret S-Boxes
At Eurocrypt 2001, Biryukov and Shamir investigated the security of AES-like ciphers where the substitutions and affine transformations are all key-dependent and successfully crypt...
Julia Borghoff, Lars R. Knudsen, Gregor Leander, S...
IWPEC
2009
Springer
14 years 3 months ago
Partitioning into Sets of Bounded Cardinality
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
Mikko Koivisto
FSTTCS
2007
Springer
14 years 2 months ago
Post Embedding Problem Is Not Primitive Recursive, with Applications to Channel Systems
We introduce PEP, the Post Embedding Problem, a variant of PCP where one compares strings with the subword relation, and PEPreg , a further variant where solutions are constrained ...
Pierre Chambart, Ph. Schnoebelen
WG
2007
Springer
14 years 2 months ago
Complexity and Approximation Results for the Connected Vertex Cover Problem
We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...
Bruno Escoffier, Laurent Gourvès, Jé...
NN
2004
Springer
14 years 2 months ago
On the Usefulness of Almost-Redundant Information for Pattern Recognition
Abstract. In this paper we give some pedagogical explanation of those situations where the use of redundant or almost-redundant information can improve the recognition rates of pat...
Marcos Faúndez-Zanuy