We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
Abstract. RNA shapes, introduced by Giegerich et al. (17), provide a useful classification of the branching complexity for RNA secondary structures. In this paper, we derive an exa...
In this paper, we study k-noncrossing, -canonical RNA pseudoknot structures with minimum arc-length greater or equal to four. Let T OE4 k; .n/ denote the number of these structure...
Computational methods, which can be implemented using standard Cox regression software, are given for fitting “exact” pseudolikehood estimates and robust and asymptotic varia...
The Partially Observable Markov Decision Process has long been recognized as a rich framework for real-world planning and control problems, especially in robotics. However exact s...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun