Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T]. A feasible solution to t...
Simulations involving processes at very different time scales can be so slow to converge that starting in one state and waiting for a representative sample of the state space to b...
We present a new semi-supervised training procedure for conditional random fields (CRFs) that can be used to train sequence segmentors and labelers from a combination of labeled a...
Feng Jiao, Shaojun Wang, Chi-Hoon Lee, Russell Gre...
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regul...
We present Penumbra Limit Maps, a technique for rendering soft shadows from a modified shadow map. The shadow representation used by our method has excellent interpolation propert...