11862 search results - page 263 / 2373 » Relative information completeness |
141
click to vote
INFFUS
2006
15 years 4 months ago
2006
This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic k...
148
click to vote
ISI
2006
Springer
15 years 4 months ago
2006
Springer
We present an overview of our work in information fusion for intelligence analysis. This work includes the Hats Simulator and the COLAB system. The Hats Simulator is a parameterize...
150
click to vote
NAACL
2010
15 years 2 months ago
2010
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
130
click to vote
PROVSEC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempt...
157
click to vote
IGPL
2011
14 years 11 months ago
2011
We show that the equational theory of representable lattice-ordered residuated semigroups is not finitely axiomatizable. We apply this result to the problem of completeness of su...