Sciweavers

4004 search results - page 8 / 801
» How Many Packets Can We Encode
Sort
View
DAGSTUHL
2007
13 years 10 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
GECCO
2008
Springer
103views Optimization» more  GECCO 2008»
13 years 9 months ago
How generative encodings fare on less regular problems
Generative representations allow the reuse of code and thus facilitate the evolution of repeated phenotypic themes or modules. It has been shown that generative representations pe...
Jeff Clune, Charles Ofria, Robert T. Pennock
ICDE
2007
IEEE
161views Database» more  ICDE 2007»
14 years 2 months ago
How to scalably and accurately skip past streams
Data stream methods look at each new item of the stream, perform a small number of operations while keeping a small amount of memory, and still perform muchneeded analyses. Howeve...
Supratik Bhattacharyya, André Madeira, S. M...
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
15 years 3 months ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox
VTC
2010
IEEE
167views Communications» more  VTC 2010»
13 years 7 months ago
Pseudo Random Network Coding Design for IEEE 802.16m Enhanced Multicast and Broadcast Service
—Applying network coding on broadcasting service is known to reduce times of transmission in the process of recovering the loss packets. In previous design, coding coefficients ...
Cheng-Chih Chao, Ching-Chun Chou, Hung-Yu Wei