Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical diļ¬...
In the past decade or so, semi-deļ¬nite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovat...
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...
Abstract The 2-Interval Pattern problem is to ļ¬nd the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...