Sciweavers

589 search results - page 46 / 118
» On the Use of Combining Rules in Relational Probability Tree...
Sort
View
ALGORITHMICA
1998
73views more  ALGORITHMICA 1998»
14 years 9 months ago
Linear Probing and Graphs
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
Donald E. Knuth
DMIN
2009
136views Data Mining» more  DMIN 2009»
14 years 7 months ago
Evaluating Algorithms for Concept Description
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
Cecilia Sönströd, Ulf Johansson, Tuve L&...
JASIS
2000
120views more  JASIS 2000»
14 years 9 months ago
Probabilistic datalog: Implementing logical information retrieval for advanced applications
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...
Norbert Fuhr
JMLR
2010
147views more  JMLR 2010»
14 years 4 months ago
Image Denoising with Kernels Based on Natural Image Relations
A successful class of image denoising methods is based on Bayesian approaches working in wavelet representations. The performance of these methods improves when relations among th...
Valero Laparra, Juan Gutierrez, Gustavo Camps-Vall...
PADL
2010
Springer
15 years 6 months ago
Implementing Query Answering for Hybrid MKNF Knowledge Bases
Abstract. Ontologies and rules are usually loosely coupled in knowledge representation formalisms. In fact, ontologies use open-world reasoning while the leading semantics for rule...
Ana Sofia Gomes, José Júlio Alferes,...