472 search results - page 39 / 95 » Limiting Negations in Formulas |
ICCV
2007
IEEE
14 years 4 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
SPAA
1990
ACM
14 years 2 months ago
1990
ACM
Multithreading has been proposed as an architectural strategy for tolerating latency in multiprocessors and, through limited empirical studies, shown to offer promise. This paper ...
FLAIRS
2008
14 years 19 days ago
2008
Combining probability and first-order logic has been the subject of intensive research during the last ten years. The most well-known formalisms combining probability and some sub...
JCC
2008
13 years 10 months ago
2008
: We propose the algorithm to evaluate the Coulomb potential in the ab initio density functional calculation on the graphics processor unit (GPU). The numerical accuracy required f...
FUIN
2010
13 years 8 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...