1951 search results - page 288 / 391 » An algorithm for improving graph partitions |
107
click to vote
JAIR
2007
15 years 4 months ago
2007
The paper presents a new sampling methodology for Bayesian networks that samples only a subset of variables and applies exact inference to the rest. Cutset sampling is a network s...
140
click to vote
MP
2007
15 years 3 months ago
2007
Given a graph with costs on the edges, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of the nodes of this graph...
157
click to vote
CLUSTER
2002
IEEE
15 years 4 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
141
click to vote
SODA
2003
ACM
15 years 5 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
163
click to vote
HIPC
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...