316 search results - page 29 / 64 » On Approximate Majority and Probabilistic Time |
CC
2007
Springer
14 years 9 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 ...
JELIA
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
87
Voted
MICAI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
85
Voted
NN
1997
Springer
15 years 1 months ago
1997
Springer
Bayesian networks are directed acyclic graphs that represent dependencies between variables in a probabilistic model. Many time series models, including the hidden Markov models (H...
101
click to vote
CVPR
2009
IEEE
16 years 4 months ago
2009
IEEE
This article proposes a novel similarity measure between
vector sequences. Recently, a model-based approach was
introduced to address this issue. It consists in modeling
each se...