492 search results - page 42 / 99 » Simplifying Probabilistic Programs Using Computer Algebra |
105
click to vote
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
We present a probabilistic multi-cue tracking approach constructed by employing a novel randomized template tracker and a constant color model based particle filter. Our approach ...
123
Voted
ENTCS
2006
15 years 17 days ago
2006
We describe an automatic complexity analysis mechanism for programs extracted from proofs carried out with the proof assistant Coq. By extraction, we mean the automatic generation...
96
Voted
RECOMB
2007
Springer
16 years 26 days ago
2007
Springer
Transcription factor (TF) binding to its DNA target site is a fundamental regulatory interaction. The most common model used to represent TF binding specificities is a position spe...
114
click to vote
TPHOL
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract. It is well known that mathematical proofs often contain (abstract) algorithms, but although these algorithms can be understood by a human, it still takes a lot of time an...
209
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...