A Viterbi path of length n of a discrete Markov chain is a sequence of n + 1 states that has the greatest probability of ocurring in the Markov chain. We divide the space of all M...
Abstract-- A novel method is proposed for performing multilabel, interactive image segmentation. Given a small number of pixels with user-defined (or pre-defined) labels, one can a...
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
We consider the combination of two ideas from the hashing literature: the power of two choices and Bloom filters. Specifically, we show via simulations that, in comparison with a...
—Probability models are estimated by use of penalized log-likelihood criteria related to AIC and MDL. The accuracies of the density estimators are shown to be related to the trad...