23 search results - page 4 / 5 » csr 2009 |
110
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
175
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
Face recognition algorithms need to deal with variable
lighting conditions. Near infrared (NIR) image based face
recognition technology has been proposed to effectively
overcome...
118
Voted
CSR
2009
Springer
15 years 7 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...
142
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
144
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...