Sciweavers

290 search results - page 39 / 58
» Lattice-based computation of Boolean functions
Sort
View
FSE
2006
Springer
124views Cryptology» more  FSE 2006»
13 years 11 months ago
Cryptanalysis of Grain
Abstract. Grain [11] is a lightweight stream cipher submitted by M. Hell, T. Johansson, and W. Meier to the eSTREAM call for stream cipher proposals of the European project ECRYPT ...
Côme Berbain, Henri Gilbert, Alexander Maxim...
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
14 years 4 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee
ICCV
2007
IEEE
14 years 1 months ago
Structure from Motion with Missing Data is NP-Hard
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
David Nistér, Fredrik Kahl, Henrik Stew&eac...
BIRTHDAY
2003
Springer
14 years 25 days ago
Digital Algebra and Circuits
Abstract. Digital numbers D are the world’s most popular data representation: nearly all texts, sounds and images are coded somewhere in time and space by binary sequences. The m...
Jean Vuillemin
MFCS
2009
Springer
14 years 2 months ago
Synchronization of Regular Automata
Functional graph grammars are finite devices which generate the class of regular automata. We recall the notion of synchronization by grammars, and for any given grammar we consid...
Didier Caucal