Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
We present a new method for nonlinear prediction of discrete random sequences under minimal structural assumptions. We give a mathematical construction for optimal predictors of s...
Feathers, unlike other cutaneous appendages such as hair, fur, or scales have a definite structure. Variation in feather structure creates a wide range of resulting appearances. C...
In this paper we propose an intrinsic developmental algorithm that is designed to allow a mobile robot to incrementally progress through levels of increasingly sophisticated behav...
Douglas S. Blank, Deepak Kumar, Lisa Meeden, James...