434 search results - page 86 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Many recommendation and retrieval tasks can be represented as proximity queries on a labeled directed graph, with typed nodes representing documents, terms, and metadata, and labe...
100
click to vote
GLOBECOM
2007
IEEE
15 years 1 months ago
2007
IEEE
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
CGO
2008
IEEE
14 years 11 months ago
2008
IEEE
Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence of complex c...
DAC
2008
ACM
14 years 11 months ago
2008
ACM
The problem attacked in this paper is one of automatically mapping an application onto a Network-on-Chip (NoC) based chip multiprocessor (CMP) architecture in a locality-aware fas...
BMCBI
2010
14 years 9 months ago
2010
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...