19320 search results - page 383 / 3864 » On the complexity of computing determinants |
154
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
193
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Background modeling plays an important role in video surveillance, yet in complex scenes it is still a challenging problem. Among many difficulties, problems caused by illuminatio...
183
click to vote
COMSIS
2010
15 years 4 months ago
2010
Multi-video summarization is a great theoretical and technical challenge due to the wider diversity of topics in multi-video than singlevideo as well as the multi-modality nature o...
189
click to vote
JCST
2010
15 years 1 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
218
click to vote
CSR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...