Sciweavers

8825 search results - page 109 / 1765
» All for one or one for all
Sort
View
COMBINATORICA
2010
14 years 10 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel
TSP
2010
14 years 8 months ago
A robust method to count and locate audio sources in a multichannel underdetermined mixture
We propose a method to count and estimate the mixing directions in an underdetermined multichannel mixture. The approach is based on the hypothesis that in the neighbourhood of som...
Simon Arberet, Rémi Gribonval, Fréd&...
IACR
2011
85views more  IACR 2011»
14 years 28 days ago
Some Instant- and Practical-Time Related-Key Attacks on KTANTAN32/48/64
The hardware-attractive block cipher family KTANTAN was studied by Bogdanov and Rechberger who identified flaws in the key schedule and gave a meet-in-the-middle attack. We revis...
Martin Ågren
CP
2009
Springer
16 years 1 months ago
Constraints of Difference and Equality: A Complete Taxonomic Characterisation
Abstract. Many combinatorial problems encountered in practice involve constraints that require that a set of variables take distinct or equal values. The AllDifferent constraint, i...
Emmanuel Hebrard, Dániel Marx, Barry O'Sull...
FSE
2007
Springer
116views Cryptology» more  FSE 2007»
15 years 7 months ago
Two General Attacks on Pomaranch-Like Keystream Generators
Two general attacks that can be applied to all versions and variants of the Pomaranch stream cipher are presented. The attacks are demonstrated on all versions and succeed with com...
Håkan Englund, Martin Hell, Thomas Johansson