Sciweavers

4498 search results - page 435 / 900
» How to Invent Functions
Sort
View
PODC
1999
ACM
15 years 11 months ago
Dynamically Configurable Distributed Objects
The dynamically configurable distributed object (DCDO) model helps enable object evolution and facilitate the development of distributed objects from multiple independent implemen...
Michael J. Lewis, Andrew S. Grimshaw
FOCS
1999
IEEE
15 years 11 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
PG
1997
IEEE
15 years 11 months ago
Rendering of spherical light fields
A plenoptic function is a parameterized function describing the flow of light in space, and has served as a key idea in building some of the recent image-based rendering systems....
Insung Ihm, Sanghoon Park, Rae Kyoung Lee
PLDI
1996
ACM
15 years 11 months ago
Realistic Compilation by Partial Evaluation
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (closures) and the transformation to tail-recursive...
Michael Sperber, Peter Thiemann
FOCS
1990
IEEE
15 years 11 months ago
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
Avrim Blum