We consider a class of continuous-time cooperative systems evolving on the positive orthant Rn +. We show that if the origin is globally attractive, then it is also globally stabl...
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Abstract. We have developed a method for generating non photorealistic animations of a target image. The animations start as a random collection of triangular strokes on a canvas a...
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
We study the problem of computing general static-arbitrage bounds for European basket options; that is, computing bounds on the price of a basket option, given the only assumption...
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic...
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...