302 search results - page 20 / 61 » Efficient Algorithms for the Longest Path Problem |
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
CCR
2008
13 years 8 months ago
2008
Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying re...
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
BMCBI
2010
13 years 8 months ago
2010
Background: Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to th...
ASUNAM
2010
IEEE
13 years 10 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...