Collocation methods are a well developed approach for the numerical solution of smooth and weakly-singular Volterra integral equations. In this paper we extend these methods, thro...
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
This paper presents a new approach to ranking relevant images for retrieval. Distance in the feature space associated with a kernel is used to rank relevant images. An adaptive qu...