HUA YUN CHEN, Estimation and Inference Based on Neumann Series Approximation to Locally Efficient Score in Missing Data Problems, Scandinavian Journal of Statistics, Vol. 36, No. 4 (December 2009), pp ...

In this paper, we consider both nonadaptive and adaptive policies for Stochastic Orienteering. We present a constant-factor approximation algorithm for the nonadaptive version and an O(log log ...

Next, we will study algorithms for NP-hard problems whose solutions are guaranteed to be within some approximation factor of the best possible solutions. Such algorithms are often quite efficient and ...

COMP_SCI 437: Approximation Algorithms VIEW ALL COURSE TIMES AND SESSIONS Prerequisites COMP_SCI 212 and COMP_SCI 336 (or similar courses) or CS MS or CS PhDs Description. This course studies ...

In the current application of MCMC to estimating the permanent of a matrix, there is a twist, which is that the Markov chain itself is arrived at via a stochastic process! Although efficient in a ...