Sciweavers

70 search results - page 3 / 14
» Table-based polynomials for fast hardware function evaluatio...
Sort
View
ARITH
2007
IEEE
13 years 9 months ago
Efficient polynomial L-approximations
We address the problem of computing a good floating-point-coefficient polynomial approximation to a function, with respect to the supremum norm. This is a key step in most process...
Nicolas Brisebarre, Sylvain Chevillard
CGF
2004
175views more  CGF 2004»
13 years 5 months ago
DiFi: Fast 3D Distance Field Computation Using Graphics Hardware
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the...
Avneesh Sud, Miguel A. Otaduy, Dinesh Manocha
FCCM
2000
IEEE
122views VLSI» more  FCCM 2000»
13 years 10 months ago
Evaluating Hardware Compilation Techniques
Hardware compilation techniques which use highlevel programming languages to describe and synthesize hardware are gaining popularity. They are especially useful for reconfigurable...
Markus Weinhardt, Wayne Luk
ECBS
2007
IEEE
122views Hardware» more  ECBS 2007»
14 years 3 days ago
Time- and Space-Efficient Evaluation of Sparse Boolean Functions in Embedded Software
The paper addresses software implementation of large sparse systems of Boolean functions. Fast evaluation of such functions with the smallest memory consumption is often required ...
Vaclav Dvorak
CHES
2005
Springer
111views Cryptology» more  CHES 2005»
13 years 11 months ago
Hardware Acceleration of the Tate Pairing in Characteristic Three
Although identity based cryptography offers many functional advantages over conventional public key alternatives, the computational costs are significantly greater. The core comp...
Philipp Grabher, Dan Page