Sciweavers

2035 search results - page 185 / 407
» Working memory
Sort
View
142
Voted
FSE
1993
Springer
89views Cryptology» more  FSE 1993»
15 years 7 months ago
Parallel FFT-Hashing
Parallel FFT-Hashing was designed by C. P. Schnorr and S. Vaudenay in 1993. The function is a simple and light weight hash algorithm with 128-bit digest. Its basic component is a m...
Claus-Peter Schnorr, Serge Vaudenay
130
Voted
ICDCS
2010
IEEE
15 years 7 months ago
A Spinning Join That Does Not Get Dizzy
— As network infrastructures with 10 Gb/s bandwidth and beyond have become pervasive and as cost advantages of large commodity-machine clusters continue to increase, research and...
Philip Werner Frey, Romulo Goncalves, Martin L. Ke...
DSD
2009
IEEE
147views Hardware» more  DSD 2009»
15 years 7 months ago
A High Performance Hardware Architecture for One Bit Transform Based Motion Estimation
Motion Estimation (ME) is the most computationally intensive part of video compression and video enhancement systems. One bit transform (1BT) based ME algorithms have low computat...
Abdulkadir Akin, Yigit Dogan, Ilker Hamzaoglu
123
Voted
EVOW
2009
Springer
15 years 7 months ago
Efficient Signal Processing and Anomaly Detection in Wireless Sensor Networks
In this paper the node-level decision unit of a self-learning anomaly detection mechanism for office monitoring with wireless sensor nodes is presented. The node-level decision uni...
Markus Wälchli, Torsten Braun
167
Voted
DAMON
2006
Springer
15 years 7 months ago
Processing-in-memory technology for knowledge discovery algorithms
The goal of this work is to gain insight into whether processingin-memory (PIM) technology can be used to accelerate the performance of link discovery algorithms, which represent ...
Jafar Adibi, Tim Barrett, Spundun Bhatt, Hans Chal...