Sciweavers

634 search results - page 103 / 127
» Completion Procedures as Semidecision Procedures
Sort
View
WSCG
2003
176views more  WSCG 2003»
13 years 9 months ago
Grid Method Classification of Islamic Geometric Patterns
This paper proposes a rational classification of Islamic Geometric Patterns (IGP) based on the Minimum Number of Grids (MNG) and Lowest Geometric Shape (LGS) used in the construct...
Ahmad Aljamali, Ebad Banissi
NIPS
1998
13 years 9 months ago
Approximate Learning of Dynamic Models
Inference is a key component in learning probabilistic models from partially observable data. When learning temporal models, each of the many inference phases requires a complete ...
Xavier Boyen, Daphne Koller
MVA
2000
330views Computer Vision» more  MVA 2000»
13 years 9 months ago
3D Reconstruction Based on Epipolar Geometry
In this paper, we propose a new method for 3D reconstruction from three cameras based on the projective geometry. If the subject is just synthesizing images from new viewpoint, 3D...
Makoto Kimura, Hideo Saito
ANLP
1992
170views more  ANLP 1992»
13 years 9 months ago
Automatic Extraction of Facts from Press Releases to Generate News Stories
While complete understanding of arbitrary input text remains in the future, it is currently possible to construct natural language processing systems that provide a partial unders...
Peggy M. Andersen, Philip J. Hayes, Steven P. Wein...
C3S2E
2010
ACM
13 years 9 months ago
Scalable formula decomposition for propositional satisfiability
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
Anthony Monnet, Roger Villemaire