We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, with the same complexity as the best existing parsers for constituency formalisms of equivalent generative power. We then extend this algorithm to handle all well-nested structures with gap degree bounded by any consta...

The symbolic value partition problem is more general than the reduct problem and more complicated than the discretization problem. In this paper, we point out that the symbolic value partition problem can be converted into a series of reduct problems and propose an algorithm called reduction based symbolic value partition (RBSVP) whose all possible outputs form the set of all partition reducts....

In 2001, Károlyi, Pach and Tóth introduced a family of point sets to solve an Erdős-Szekeres type problem; which have been used to solve several other Edős-Szekeres type problems. In this paper we refer to these sets as nested almost convex sets. A nested almost convex set X has the property that the interior of every triangle determined by three points in the same convex layer of X , contains ...

We propose a new hierarchical scheme for yard crane (YC) workload management in container terminals. We also propose time partitioning algorithm and space partition algorithm for deploying YCs to handle the changing job arrival patterns in a row of yard blocks. The main differences between our approach and most of the methods in literature are: (1) Average vehicle job waiting time instead of th...

Computing a fill-reducing ordering of a sparse matrix is a critical step for sparse direct solvers. In the early days of the field, “bottom-up” or “greedy” methods were popular. These include the Minimum Degree algorithm [7] and its variants, and profile-reducing methods such as the Cuthill-McKee algorithm [2]. More recently, “top-down” or “divide-and-conquer” methods such as Nested Dissection ...

We investigate the contextual multi-armed bandit problem in an adversarial setting and introduce an online algorithm that asymptotically achieves the performance of the best contextual bandit arm selection strategy under certain conditions. We show that our algorithm is highly efficient and provides significantly improved performance with a guaranteed performance upper bound in a strong mathema...

We present a deterministic linear time and space algorithm for ordered partition of a set T of n integers into n sets T0 ≤ T1 ≤ · · · ≤ Tn1/2−1, where |Ti| = θ(n ) and Ti ≤ Ti+1 means that maxTi ≤ minTi+1.