2294 search results - page 136 / 459 » From Path Graphs to Directed Path Graphs |
ERSA
2009
14 years 7 months ago
2009
- The FPGA (re)configuration is a time-consuming process and a bottleneck in FPGA-based Run-Time Reconfigurable (RTR) systems. In this paper, we present a High Level Synthesis (HLS...
112
click to vote
IEICET
2010
14 years 7 months ago
2010
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted compl...
102
click to vote
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
ISCIS
2004
Springer
15 years 3 months ago
2004
Springer
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...