9842 search results - page 384 / 1969 » The Complexity of the Matching-Cut Problem |
130
click to vote
CSUR
2000
15 years 4 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
127
click to vote
PVLDB
2010
15 years 2 months ago
2010
Virtual views are a mechanism that facilitates re-use and makes queries easier to express. However the use of iterative view definitions makes very simple query evaluation and an...
144
click to vote
TCBB
2010
15 years 2 months ago
2010
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
166
click to vote
ISCAS
2011
IEEE
14 years 8 months ago
2011
IEEE
— The last two decades have seen many efficient algorithms and architectures for the design of low-complexity bit-parallel Multiple Constant Multiplications (MCM) operation, tha...
151
click to vote
ICPP
1992
IEEE
15 years 8 months ago
1992
IEEE
Many routing problems in parallel processing, such as concentration and permutation problems, can be cast as sorting problems. In this paper, we consider the problem of sorting on ...