101 search results - page 6 / 21 » An Efficient Algorithm for Solving the Dyck-CFL Reachability... |
ESA
1998
Springer
13 years 11 months ago
1998
Springer
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
CONSTRAINTS
2008
13 years 7 months ago
2008
Aligning DNA and protein sequences is a core technique in molecular biology. Often, it is desirable to include partial prior knowledge and conditions in an alignment. Going beyond...
JDCTA
2010
13 years 2 months ago
2010
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
including the one proposed in [5]. Minieka showed that all the eight problems can be solved in polynomial time except the one of finding the maximum distancesum tree of a specified...
IJES
2006
13 years 7 months ago
2006
: We present efficient solutions for the non-contiguous linear placement of data-paths for reconfigurable fabrics. A strip-based architecture is assumed for the reconfigurable fabr...