824 search results - page 130 / 165 » Learning probabilistic logic models from probabilistic examp... |
125
Voted
IJMSO
2006
15 years 3 months ago
2006
Recent expectations regarding the new generation of Web strongly depend on the success of Semantic Web technology. Resource Description Framework (RDF) is a basis for an explicit a...
122
Voted
QEST
2006
IEEE
15 years 9 months ago
2006
IEEE
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
142
Voted
ECRTS
2004
IEEE
15 years 7 months ago
2004
IEEE
The contribution of this paper is threefold. First, an improvement to a previously published paper on the timing analysis of Controller Area Network (CAN) in the presence of trans...
110
Voted
NAACL
2007
15 years 5 months ago
2007
The task of identifying synonymous relations and objects, or Synonym Resolution (SR), is critical for high-quality information extraction. The bulk of previous SR work assumed str...
124
Voted
FLAIRS
2001
15 years 5 months ago
2001
We present an objective approach for evaluating probability elicitation methods in probabilistic models. Our method draws on ideas from research on learning Bayesian networks: if ...