Sciweavers

4212 search results - page 38 / 843
» On Compressible Pairings and Their Computation
Sort
View
98
Voted
ICISC
2007
96views Cryptology» more  ICISC 2007»
15 years 1 months ago
Colliding Message Pair for 53-Step HAS-160
We present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. The attack is based on the work of Cho e...
Florian Mendel, Vincent Rijmen
98
Voted
SIGCSE
2010
ACM
158views Education» more  SIGCSE 2010»
15 years 22 days ago
The benefits of pairing by ability
An analysis of data from 259 CS1 students is performed to compare the performance of students who were paired by demonstrated ability to that of students who were paired randomly ...
Grant Braught, John MacCormick, Tim Wahls
134
Voted
IEEECGIV
2009
IEEE
15 years 7 months ago
Two Dimensional Compressive Classifier for Sparse Images
The theory of compressive sampling involves making random linear projections of a signal. Provided signal is sparse in some basis, small number of such measurements preserves the ...
Armin Eftekhari, Hamid Abrishami Moghaddam, Massou...
80
Voted
CLUSTER
2008
IEEE
15 years 7 months ago
Exploiting data compression in collective I/O techniques
This paper presents Two-Phase Compressed I/O (TPC I/O,) an optimization of the Two-Phase collective I/O technique from ROMIO, the most popular MPI-IO implementation. In order to r...
Rosa Filgueira, David E. Singh, Juan Carlos Pichel...
105
Voted
CCECE
2006
IEEE
15 years 6 months ago
Single-Sensor Image Compression from the End-User's Perspective
Single-sensor imaging pipelines comprised of various image compression and demosaicking solutions are presented. Since the end-user usually inspects captured images available in t...
Rastislav Lukac, Konstantinos N. Plataniotis