Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

107

Voted

DAM
2007

77views more DAM 2007»

Decompositions of graphs of functions and fast iterations of lookup tables

15 years 2 months ago

Decompositions of graphs of functions and fast iterations of lookup tables

Download u.cs.biu.ac.il

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 implementation only increases the storage space by a small constant factor. © 2006 Elsevier B.V. All rights reserved.

Boaz Tsaban

Real-time Traffic

Computational Complexity | DAM 2007 | Lookup Table | Small Constant Factor |

claim paper

Related Content

» Computing supportminimal subfunctions during functional decomposition

» Graph Database Indexing Using Structured Graph Decomposition

» Design of Arbiters and Allocators Based on MultiTerminal BDDs

» Scalable IP Lookups using Shape Graphs

» Boolean factoring and decomposition of logic networks

» Residual Algorithms Reinforcement Learning with Function Approximation

» Fast direct policy evaluation using multiscale analysis of Markov diffusion processes

» Learning Evaluation Functions for Large Acyclic Domains

» Blooming Trees for Minimal Perfect Hashing

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DAM
Authors	Boaz Tsaban

Comments (0)