494 search results - page 45 / 99 » Probabilistic Programming in Anglican |
STACS
2005
Springer
15 years 3 months ago
2005
Springer
We introduce and study Recursive Markov Chains (RMCs), which extend ordinary finite state Markov chains with the ability to invoke other Markov chains in a potentially recursive m...
90
Voted
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper we consider how to efficiently identify tags on the moving conveyor. Considering conditions like the path loss and multi-path effect in realistic settings, we first p...
IBPRIA
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
78
Voted
TCS
2008
14 years 10 months ago
2008
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
BMCBI
2005
14 years 10 months ago
2005
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...