We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid ...
Typical color image processing techniques use profiles consisting of sparse multi-dimensional lookup tables that interpolate between adjacent nodes to prepare an image for renderi...
Edward F. Hattenberger, Mitchell R. Rosen, Noboru ...
A pattern database is a heuristic function stored as a lookup table which stores the lengths of optimal solutions for instances of subproblems. All previous pattern databases had ...
Ariel Felner, Ram Meshulam, Robert C. Holte, Richa...
Genetic Parallel Programming (GPP) is a novel Genetic Programming paradigm. Based on the GPP paradigm and a local search operator - FlowMap, a logic circuit synthesizing system in...
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling t...
Xuezheng Liu, Guangwen Yang, Jinfeng Hu, Ming Chen...
— A Parallel algorithm and its hardware implementation of Inverse Halftone operation is proposed in this paper. The algorithm is based on Lookup Tables from which the inverse hal...
Umair F. Siddiqi, Sadiq M. Sait, Aamir A. Farooqui