75 search results - page 11 / 15 » Definability of Combinatorial Functions and Their Linear Rec... |
CSL
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
FOCS
1993
IEEE
14 years 1 months ago
1993
IEEE
Learnability in Valiant’s PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free conver...
IJCAI
2007
13 years 11 months ago
2007
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi...
ICLP
2009
Springer
14 years 10 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
SSWMC
2004
13 years 11 months ago
2004
We study a detection-theoretic approach to steganalysis. The relative entropy between covertext and stegotext determines the steganalyzer's difficulty in discriminating them,...