Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Online Resource
    Online Resource
    Institute for Operations Research and the Management Sciences (INFORMS) ; 2015
    In:  Mathematics of Operations Research Vol. 40, No. 4 ( 2015-10), p. 888-901
    In: Mathematics of Operations Research, Institute for Operations Research and the Management Sciences (INFORMS), Vol. 40, No. 4 ( 2015-10), p. 888-901
    Abstract: Stochastic billiards can be used for approximate sampling from the boundary of a bounded convex set through the Markov Chain Monte Carlo paradigm. This paper studies how many steps of the underlying Markov chain are required to get samples (approximately) from the uniform distribution on the boundary of the set, for sets with an upper bound on the curvature of the boundary. Our main theorem implies a polynomial-time algorithm for sampling from the boundary of such sets.
    Type of Medium: Online Resource
    ISSN: 0364-765X , 1526-5471
    Language: English
    Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
    Publication Date: 2015
    detail.hit.zdb_id: 2004273-5
    detail.hit.zdb_id: 195683-8
    SSG: 3,2
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages