Sciweavers

11 search results - page 2 / 3
» Remarks on Two Nonstandard Versions of Periodicity in Words
Sort
View
IPL
2010
98views more  IPL 2010»
13 years 3 months ago
Distinguishing attacks on stream ciphers based on arrays of pseudo-random words
In numerous modern stream ciphers, the internal state consists of a large array of pseudo-random words, and the output key-stream is a relatively simple function of the state. In ...
Nathan Keller, Stephen D. Miller
AIA
2006
13 years 6 months ago
Recurrent and Concurrent Neural Networks for Objects Recognition
A system based on a neural network framework is considered. We used two neural networks, an Elman network [1][2] and a Kohonen (concurrent) network [3], for a categorization task....
Federico Cecconi, Marco Campenní
JCT
2007
111views more  JCT 2007»
13 years 5 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
ENTCS
2006
168views more  ENTCS 2006»
13 years 5 months ago
A Functional Programming Framework for Latency Insensitive Protocol Validation
Latency insensitive protocols (LIPs) have been proposed as a viable means to connect synchronous IP blocks via long interconnects in a system-on-chip. The reason why one needs to ...
Syed Suhaib, Deepak Mathaikutty, Sandeep K. Shukla...
WOLLIC
2007
Springer
13 years 11 months ago
Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
Michael Moortgat