1341 search results - page 53 / 269 » Probabilistic Abstraction Hierarchies |
183
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
As the amount of textual information grows explosively in various kinds of business systems, it becomes more and more desirable to analyze both structured data records and unstruc...
176
click to vote
COCO
2005
Springer
15 years 11 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
159
click to vote
CC
2007
Springer
15 years 6 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
177
click to vote
ECCV
2004
Springer
16 years 8 months ago
2004
Springer
Abstract. We describe a novel approach to view interpolation from image sequences based on probabilistic depth carving. This builds a multivalued representation of depth for novel ...
158
click to vote
QEST
2009
IEEE
16 years 1 months ago
2009
IEEE
—Symmetry reduction is a technique for combating state-space explosion in model checking. The generic representatives approach to symmetry reduction uses a language-level transla...