1866 search results - page 250 / 374 » A Computational Journey into Nonlinearity |
191
click to vote
VALUETOOLS
2006
ACM
16 years 20 days ago
2006
ACM
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...
128
click to vote
CEC
2005
IEEE
16 years 10 days ago
2005
IEEE
—A principal challenge in modern computational finance is efficient portfolio design – portfolio optimization followed by decision-making. Optimization based on even the widely...
179
click to vote
SCALESPACE
2005
Springer
16 years 6 days ago
2005
Springer
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...
219
click to vote
STACS
2005
Springer
16 years 6 days ago
2005
Springer
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...
162
click to vote
ECCV
2004
Springer
16 years 3 days ago
2004
Springer
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...