1430 search results - page 59 / 286 » Representing Probability Measures using Probabilistic Proces... |
STACS
2001
Springer
14 years 1 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
ICIP
2004
IEEE
14 years 10 months ago
2004
IEEE
Much work has been done in the field of visual object tracking, yielding a wide range of trackers, including ones aimed for multiple objects. In many cases, there may be a couplin...
CSFW
2011
IEEE
12 years 8 months ago
2011
IEEE
—This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier’s ...
TVLSI
2008
13 years 9 months ago
2008
Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid appr...
ICPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Probabilistic language models are critical to applications in natural language processing that include speech recognition, optical character recognition, and interfaces for text e...