Sciweavers

19 search results - page 2 / 4
» A New and Simple Chaos Toy
Sort
View
LICS
2009
IEEE
14 years 2 months ago
Clipping: A Semantics-Directed Syntactic Approximation
In this paper we introduce “clipping,” a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for...
Dan R. Ghica, Adam Bakewell
ISCAS
2007
IEEE
104views Hardware» more  ISCAS 2007»
14 years 1 months ago
Noncoherent Correlation-Based Communication Systems Choosing Different Chaotic Maps
— This paper proposes a new noncoherent detection system improved based on the differential chaos shift keying (DCSK) and the correlation delay shift keying (CDSK). In this schem...
Shintaro Arai, Yoshifumi Nishio
CAV
2012
Springer
236views Hardware» more  CAV 2012»
11 years 10 months ago
Lock Removal for Concurrent Trace Programs
Abstract. We propose a trace-based concurrent program analysis to soundly remove redundant synchronizations such as locks while preserving the behaviors of the concurrent computati...
Vineet Kahlon, Chao Wang
DAGSTUHL
2007
13 years 9 months ago
How Fast can be Algebraic Attacks on Block Ciphers?
In this paper we give a specification of a new block cipher that can be called the Courtois Toy Cipher (CTC). It is quite simple, and yet very much like any other known block ciph...
Nicolas Courtois
SIGCSE
2006
ACM
201views Education» more  SIGCSE 2006»
14 years 1 months ago
Everything I needed to know about teaching I learned in kindergarten: bringing elementary education techniques to undergraduate
By expanding the teaching styles used in computer science classrooms, we can expand the audience of students that enjoy and excel in technology. Rather than focusing on major curr...
Shannon Pollard, Robert C. Duvall