Sciweavers

33 search results - page 3 / 7
» Algorithms for Propositional KB Approximation
Sort
View
106
Voted
ICIP
1999
IEEE
16 years 2 months ago
Color Documents on the Web with DJVU
We present a new image compression technique called DjVu" that is speci cally geared towards the compression of scanned documents in color at high resolution. With DjVu, a ma...
Bill Riemers, Léon Bottou, Pascal Vincent, ...
104
Voted
SEMWEB
2010
Springer
14 years 10 months ago
Evolution of DL - Lite Knowledge Bases
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Dm...
120
Voted
ICDE
2010
IEEE
227views Database» more  ICDE 2010»
16 years 10 days ago
Approximate Confidence Computation in Probabilistic Databases
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
Dan Olteanu, Jiewen Huang, Christoph Koch
COCO
2003
Springer
82views Algorithms» more  COCO 2003»
15 years 5 months ago
Derandomization and Distinguishing Complexity
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
Eric Allender, Michal Koucký, Detlef Ronneb...
83
Voted
AAAI
1994
15 years 1 months ago
Learning to Reason
We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and ...
Roni Khardon, Dan Roth