1037 search results - page 22 / 208 » Topic Models Conditioned on Relations |
129
Voted
TARK
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
180
click to vote
FSE
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. Bellare and Kohno introduced a formal framework for the study of related-key attacks against blockciphers. They established sufficient conditions (output-unpredictabilit...
137
click to vote
IJCAI
2001
15 years 1 months ago
2001
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
104
Voted
APAL
1998
15 years 3 days ago
1998
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
122
click to vote
BMCBI
2007
15 years 16 days ago
2007
Background: We present a probabilistic topic-based model for content similarity called pmra that underlies the related article search feature in PubMed. Whether or not a document ...