923 search results - page 3 / 185 » Improved Slide Attacks |
ACMMSP
2004
ACM
14 years 1 months ago
2004
ACM
As superscalar processors become increasingly wide, it is inevitable that the large set of instructions to be fetched every cycle will span multiple noncontiguous basic blocks. Th...
WAIM
2004
Springer
14 years 27 days ago
2004
Springer
Efficient full-text searching is a big challenge in Peer-to-Peer (P2P) system. Recently, Distributed Hash Table (DHT) becomes one of the reliable communication schemes for P2P. Som...
ICASSP
2007
IEEE
14 years 1 months ago
2007
IEEE
We develop a general framework to automatically match electronic slides to the videos of corresponding presentations. Applications include supporting indexing and browsing of educ...
HICSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Existing ad hoc routing protocols are either unicast or multicast. In this paper we propose a simple extension to the Dynamic Source Routing Protocol (DSR) to cater for group comm...
ICGA
2007
13 years 7 months ago
2007
In this paper it will be explained how to use bitboards for move generation in shogi. In chess, bitboards have been used in most strong programs because of the easy representation...