Sciweavers

3758 search results - page 41 / 752
» A Complete Subsumption Algorithm
Sort
View
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
13 years 11 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
ESA
2005
Springer
162views Algorithms» more  ESA 2005»
14 years 1 months ago
Minimal Interval Completions
We study the problem of adding edges to an arbitrary graph so that the resulting graph is an interval graph. Our objective is to add an inclusion minimal set of edges, which means ...
Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve...
ICCV
1995
IEEE
13 years 11 months ago
Complete Scene Structure from Four Point Correspondences
A new technique is presented for computing 3D scene structure from point and line features in monocular image sequences. Unlike previous methods, the technique guarantees the comp...
Steven M. Seitz, Charles R. Dyer
ALGORITHMS
2010
113views more  ALGORITHMS 2010»
13 years 5 months ago
A Complete Theory of Everything (Will Be Subjective)
Increasingly encompassing models have been suggested for our world. Theories range from generally accepted to increasingly speculative to apparently bogus. The progression of theo...
Marcus Hutter
ICFCA
2009
Springer
14 years 2 months ago
Usability Issues in Description Logic Knowledge Base Completion
Abstract. In a previous paper, we have introduced an approach for extending both the terminological and the assertional part of a Description Logic knowledge base by using informat...
Franz Baader, Baris Sertkaya