The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
We investigate a general class of (black-box) constructions for range extension of weak pseudorandom functions: a construction based on m independent functions F1, . . . , Fm is gi...
Neural networks and the Kriging method are compared for constructing £tness approximation models in evolutionary optimization algorithms. The two models are applied in an identica...
We introduce tensor displays: a family of compressive light field displays comprising all architectures employing a stack of timemultiplexed, light-attenuating layers illuminated...
Gordon Wetzstein, Douglas Lanman, Matthew Hirsch, ...
In this paper, we address the problem of adaptively enriching motion description languages for multi-modal control by systematically enlarging the set of available modes. This pro...