2747 search results - page 344 / 550 » Non-oblivious Strategy Improvement |
CHES
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. A novel technique for computing a 2n-bit modular multiplication using n-bit arithmetic was introduced at CHES 2002 by Fischer and Seifert. Their technique makes use of an...
FPL
2003
Springer
15 years 4 months ago
2003
Springer
Local search methods such as WSAT have proven to be successful for solving SAT problems. In this paper, we propose two host-FPGA (Field Programmable Gate Array) co-implementations,...
115
click to vote
GRID
2003
Springer
15 years 4 months ago
2003
Springer
Data-sharing scientific communities use storage systems as distributed data stores by replicating content. In such highly replicated environments, a particular dataset can reside ...
95
Voted
ECCV
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
WAIFI
2010
Springer
15 years 4 months ago
2010
Springer
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly app...