33 search results - page 3 / 7 » Algorithms for Propositional KB Approximation |
209
Voted
ICIP
1999
IEEE
16 years 8 months ago
1999
IEEE
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...
184
Voted
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
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...
191
Voted
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
137
Voted
COCO
2003
Springer
16 years 3 hour ago
2003
Springer
We continue an investigation of resource-bounded Kolmogorov complexity and derandomization techniques begun in [2, 3]. We introduce nondeterministic time-bounded Kolmogorov comple...
169
Voted
AAAI
1994
15 years 8 months ago
1994
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 ...