2612 search results - page 325 / 523 » Switching Graphs and Their Complexity |
226
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
— This paper investigates measures of centrality that are applicable to power grids. Centrality measures are used in network science to rank the relative importance of nodes and ...
160
click to vote
SPAA
2009
ACM
15 years 11 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
153
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
182
click to vote
PODS
1999
ACM
15 years 9 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
164
click to vote
NIPS
2007
15 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...