9842 search results - page 1374 / 1969 » The Complexity of the Matching-Cut Problem |
188
click to vote
LATA
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. Gene trees are leaf-labeled trees inferred from molecular sequences. Due to duplication events arising in genome evolution, gene trees usually have multiple copies of som...
187
click to vote
TACAS
2009
Springer
16 years 2 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
182
click to vote
DATE
2009
IEEE
16 years 2 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
277
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
Least squares (LS) fitting is one of the most fundamental techniques in science and engineering. It is used to estimate parameters from multiple noisy observations. In many probl...
210
click to vote
TIME
2009
IEEE
16 years 1 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...