27692 search results - page 178 / 5539 » Where is ... |
118
Voted
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...
87
Voted
LFCS
2009
Springer
15 years 8 months ago
2009
Springer
We give a sound and complete labeled natural deduction system for an interesting fragment of CTL∗ , namely the until-free version of BCTL∗ . The logic BCTL∗ is obtained by re...
108
click to vote
MFCS
2009
Springer
15 years 8 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
108
Voted
MLDM
2009
Springer
15 years 8 months ago
2009
Springer
In two-class score-based problems the combination of scores from an ensemble of experts is generally used to obtain distributions for positive and negative patterns that exhibit a ...
122
Voted
SPIRE
2009
Springer
15 years 8 months ago
2009
Springer
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...