1963 search results - page 267 / 393 » The Maximum Solution Problem on Graphs |
101
Voted
PODC
2005
ACM
15 years 6 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
132
Voted
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
137
click to vote
BMCBI
2010
15 years 24 days ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
174
Voted
CORR
2010
Springer
15 years 23 days ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
81
Voted
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
Image segmentation plays an important role in computer vision and image analysis. In this paper, the segmentation problem is formulated as a labeling problem under a probability m...