Sciweavers

246 search results - page 10 / 50
» Tantra: A Fast PRNG Algorithm and its Implementation
Sort
View
DLS
2009
150views Languages» more  DLS 2009»
13 years 6 months ago
Fast type reconstruction for dynamically typed programming languages
Type inference and type reconstruction derive static types for program elements that have no static type associated with them. They have a wide range of usage, such as helping to ...
Frédéric Pluquet, Antoine Marot, Roe...
TOG
2012
230views Communications» more  TOG 2012»
11 years 11 months ago
Decoupling algorithms from schedules for easy optimization of image processing pipelines
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
Jonathan Ragan-Kelley, Andrew Adams, Sylvain Paris...
TITB
2002
172views more  TITB 2002»
13 years 8 months ago
Shape recovery algorithms using level sets in 2-D/3-D medical imagery: a state-of-the-art review
The class of geometric deformable models, also known as level sets, has brought tremendous impact to medical imagery due to its capability of topology preservation and fast shape r...
Jasjit S. Suri, Kecheng Liu, Sameer Singh, Swamy L...
ICCD
2001
IEEE
103views Hardware» more  ICCD 2001»
14 years 5 months ago
Improved ZDN-arithmetic for Fast Modulo Multiplication
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...
Hagen Ploog, Sebastian Flügel, Dirk Timmerman...
CHES
2007
Springer
327views Cryptology» more  CHES 2007»
14 years 2 months ago
On the Power of Bitslice Implementation on Intel Core2 Processor
Abstract. This paper discusses the state-of-the-art fast software implementation of block ciphers on Intel’s new microprocessor Core2, particularly concentrating on “bitslice i...
Mitsuru Matsui, Junko Nakajima