9842 search results - page 224 / 1969 » The Complexity of the Matching-Cut Problem |
IPL
2008
13 years 10 months ago
2008
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
ESORICS
2009
Springer
14 years 11 months ago
2009
Springer
Abstract. Interest in role-based access control has generated considerable research activity in recent years. A number of interesting problems related to the well known set cover p...
ICCS
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. Given two arc-annotated sequences (S, P) and (T, Q) representing RNA structures, the Arc-Preserving Subsequence (APS) problem asks whether (T, Q) can be obtained from (S,...
COCOON
2005
Springer
14 years 4 months ago
2005
Springer
The maximum subarray problem for a one- or two-dimensional array is to find the array portion that maiximizes the sum of array elements in it. The K-maximum subarray problem is to...
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...