4860 search results - page 367 / 972 » SNPs Problems, Complexity, and Algorithms |
98
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4...
122
Voted
DATE
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
163
Voted
CSL
2007
Springer
15 years 9 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
110
Voted
ISNN
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a block-adaptive subspace algorithm via oblique projection for blind source separation (BSS) problem of convolutive mixtures. In the proposed algorithm, the pro...
134
Voted
CSCLP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...