Sciweavers

8 search results - page 1 / 2
» Efficient Function Evaluations with Lookup Tables for Struct...
Sort
View
SIPS
2007
IEEE
13 years 11 months ago
Efficient Function Evaluations with Lookup Tables for Structured Matrix Operations
A hardware ef cient approach is introduced for elementary function evaluations in certain structured matrix computations. It is a comprehensive approach that utilizes lookup table...
Kanwaldeep Sobti, Lanping Deng, Chaitali Chakrabar...
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
13 years 6 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
ARITH
2005
IEEE
13 years 10 months ago
Table Lookup Structures for Multiplicative Inverses Modulo 2k
We introduce an inheritance property and related table lookup structures applicable to simplified evaluation of the modular operations “multiplicative inverse”, “discrete l...
David W. Matula, Alex Fit-Florea, Mitchell Aaron T...

Presentation
439views
11 years 10 months ago
Efficient Evaluation Methods of Elementary Functions Suitable for SIMD Computation
Data-parallel architectures like SIMD (Single Instruction Multiple Data) or SIMT (Single Instruction Multiple Thread) have been adopted in many recent CPU and GPU architectures. Al...
CI
1998
78views more  CI 1998»
13 years 4 months ago
Pattern Databases
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
Joseph C. Culberson, Jonathan Schaeffer