Sciweavers

17 search results - page 2 / 4
» Fast Table-Driven Algorithms for Interval Elementary Functio...
Sort
View
AMAI
2008
Springer
13 years 7 months ago
Recognition of interval Boolean functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their ...
Ondrej Cepek, David Kronus, Petr Kucera
ALENEX
2010
161views Algorithms» more  ALENEX 2010»
13 years 9 months ago
Route Planning with Flexible Objective Functions
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders
SAC
2006
ACM
14 years 1 months ago
Interval-based robust statistical techniques for non-negative convex functions, with application to timing analysis of computer
: In chip design, one of the main objectives is to decrease its clock cycle; however, the existing approaches to timing analysis under uncertainty are based on fundamentally restri...
Michael Orshansky, Wei-Shen Wang, Martine Ceberio,...
DAGSTUHL
2010
13 years 9 months ago
CSG Operations of Arbitrary Primitives with Interval Arithmetic and Real-Time Ray Casting
We apply Knoll et al.'s algorithm [9] to interactively ray-cast constructive solid geometry (CSG) objects of arbitrary primitives represented as implicit functions. Whereas m...
Younis Hijazi, Aaron Knoll, Mathias Schott, Andrew...
ASAP
2004
IEEE
141views Hardware» more  ASAP 2004»
13 years 11 months ago
Evaluating Instruction Set Extensions for Fast Arithmetic on Binary Finite Fields
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...
A. Murat Fiskiran, Ruby B. Lee