93 search results - page 1 / 19 » What Makes the Arc-Preserving Subsequence Problem Hard |
114
click to vote
ICCS
2005
Springer
15 years 9 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,...
136
click to vote
WG
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
171
click to vote
TOG
2012
13 years 6 months ago
2012
Given a large repository of geotagged imagery, we seek to automatically find visual elements, e.g. windows, balconies, and street signs, that are most distinctive for a certain g...
145
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
145
click to vote
ADAEUROPE
2010
Springer
15 years 8 months ago
2010
Springer
Now that multicore microprocessors have become a commodity, it is natural to think about employing them in all kinds of computing, including high-reliability embedded real-time sy...