238 citations · 254 across the 10 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.PL2013★ 6 cited
Infinite probability computation by cyclic explanation graphs
Taisuke Sato, Philipp Meyer
Tabling in logic programming has been used to eliminate redundant computation and also to stop infinite loop. In this paper we investigate another possibility of tabling, i.e. to c…
cs.AI2013★ 5 cited
Viterbi training in PRISM
Taisuke Sato, Keiichi Kubota
VT (Viterbi training), or hard EM, is an efficient way of parameter learning for probabilistic models with hidden variables. Given an observation , it searches for a state of hi…