Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
—A principal challenge in modern computational finance is efficient portfolio design – portfolio optimization followed by decision-making. Optimization based on even the widely...
Raj Subbu, Piero P. Bonissone, Neil Eklund, Sriniv...
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
Abstract. Temporal random variation of luminance in images can manifest in film and video due to a wide variety of sources. Typical in archived films, it also affects scenes rec...