9842 search results - page 285 / 1969 » The Complexity of the Matching-Cut Problem |
115
click to vote
ISCIS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
125
Voted
DIS
2004
Springer
15 years 9 months ago
2004
Springer
In this paper we consider privacy problems with anonymized transaction databases, i.e., transaction databases where the items are renamed in order to hide sensitive information. In...
110
Voted
CIT
2006
Springer
15 years 7 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
134
Voted
IFIPTCS
2000
15 years 7 months ago
2000
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged betwee...
143
Voted
CPM
2008
Springer
15 years 5 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...