428 search results - page 17 / 86 » Completeness of a Fact Extractor |
DOLAP
1998
ACM
15 years 1 months ago
1998
ACM
Though designing a data warehouse requires techniques completely different from those adopted for operational systems, no significant effort has been made so far to develop a comp...
ITC
1997
IEEE
15 years 1 months ago
1997
IEEE
A deterministic BIST scheme is presented which requires less hardware overhead than pseudo-random BIST but obtains better or even complete fault coverage at the same time. It take...
JAIR
2008
14 years 9 months ago
2008
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
JSYML
2007
14 years 9 months ago
2007
A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follo...
58
Voted
TVCG
2010
14 years 7 months ago
2010
— Isosurfaces are fundamental volumetric visualization tools, and are generated by the well-known Marching Cubes cases that approximate contours of trilinearly-interpolated scala...