69 search results - page 14 / 14 » Improved Approximation Algorithms for Minimum Weight Vertex ... |
FSTTCS
2009
Springer
14 years 2 days ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...
CPM
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
WABI
2005
Springer
13 years 11 months ago
2005
Springer
In contrast to proteins, many classes of functionally related RNA molecules show a rather weak sequence conservation but instead a fairly well conserved secondary structure. Hence ...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—Path diversity works by setting up multiple parallel connections between the end points using the topological path redundancy of the network. In this paper, Forward Error Correc...