161 search results - page 22 / 33 » Setting port numbers for fast graph exploration |
PACT
2009
Springer
14 years 9 days ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
MP
2010
13 years 6 months ago
2010
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
WABI
2001
Springer
14 years 5 days ago
2001
Springer
We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgrap...
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
BMCBI
2004
13 years 7 months ago
2004
Background: One of the most time-consuming tasks after performing a gene expression experiment is the biological interpretation of the results by identifying physiologically impor...