4137 search results - page 263 / 828 » On the number of matchings of a tree |
156
click to vote
ISPDC
2006
IEEE
16 years 23 days ago
2006
IEEE
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
174
click to vote
SBACPAD
2006
IEEE
2006
IEEE
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
16 years 22 days ago
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
193
click to vote
ASPDAC
2006
ACM
16 years 21 days ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
172
click to vote
APPROX
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...
172
click to vote
EUROPAR
2004
Springer
16 years 3 days ago
2004
Springer
Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...