The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 4930 of Mathematical Reviews Vol. , Issue 99g
[page]
1999
Mathematical Reviews
Preserved Fulltext
99¢:68020
99¢:68020 68M10
Sadayappan, P. (1-OHS-C; Columbus, OH);
Ercal, F. (1-MOR-C; Rolla, MO);
Ramanujam, J. (1-LAS-EL; Baton Rouge, LA)
Partitioning graphs on message-passing machines by pairwise mincut ...
, known as partitioning by pairwise mincut (PPM). ...
Graph partition strategies for generalized mean field inference
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We provide a formal analysis of the relationship between the graph cut and the GMF approximation, and explore several graph partition strategies empirically. ...
In this paper, we present a novel combination of graph partitioning algorithms with a generalized mean field (GMF) inference algorithm. ...
In the following, the set Sj , ∀j:
we explore several graph partitioning strategies on ran-
dom graphs with pairwise potentials (each clique con- ...
arXiv:1207.4156v1
fatcat:blwdiikxvzcnfl3pkvvtubmtai
An improvement of Spectral Clustering via Message Passing and Density Sensitive Similarity
2019
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Spectral clustering transforms the data clustering problem into a graph-partitioning problem and classifies data points by finding the optimal sub-graphs. ...
Therefore, this paper presents an algorithm on the basis of message passing, which makes use of a density adaptive similarity measure, describing the relations between data points and obtaining high-quality ...
There are many traditional graph partitioning methods, such as MinCut, RatioCut, the normalized cut Ncut, and Min-Max cut [5] . ...
doi:10.1109/access.2019.2929948
fatcat:6hn7t7gymvdhfnkpbd6w5aj5ny
Measuring uncertainty in graph cut solutions
2008
Computer Vision and Image Understanding
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we answer this particular question by showing how the min-marginals associated with the label assignments of a random field can be efficiently computed using a new algorithm based on dynamic ...
The min-marginal energies obtained by our proposed algorithm are exact, as opposed to the ones obtained from other inference algorithms like loopy belief propagation and generalized belief propagation. ...
This work was supported by the epsrc research grant GR/T21790/01(P) and the ist Programme of the European Community, under the PASCAL Network of Excellence, ist-2002-506778. ...
doi:10.1016/j.cviu.2008.07.002
fatcat:5zrk5bb7qbav7auvklk5ljkgna
MAP Estimation of Semi-Metric MRFs via Hierarchical Graph Cuts
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Unlike the existing LP relaxation solvers, e.g. interior-point algorithms or tree-reweighted message passing, our method is significantly faster as it uses only the efficient st-MINCUT algorithm in its ...
For this problem, we propose an accurate hierarchical move making strategy where each move is computed efficiently by solving an st-MINCUT problem. ...
The first author is funded by the DARPA grant SA4996-10929-5. ...
arXiv:1205.2633v1
fatcat:epyqgywfafaqvl7lrqy4aoytpq
Inference in Sparse Graphs with Pairwise Measurements and Side Information
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We present new algorithms and a sharp finite-sample analysis for this problem on trees and sparse graphs with poor expansion properties such as hypergrids and ring lattices. ...
For two-dimensional grids, our results improve over Globerson et al. (2015) by obtaining optimal recovery in the constant-height regime. ...
-with message passing. ...
arXiv:1703.02728v3
fatcat:wsqawom5vbdsncvx3wjfrudbje
Dynamic Graph Cuts and Their Applications in Computer Vision
[chapter]
2010
Studies in Computational Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
obtained by minimizing energy functions. ...
The primary reason for this rising popularity has been the successes of efficient graph cut based minimization algorithms in solving many low level vision problems such as image segmentation, object reconstruction ...
Observe that although the cost of the st-mincut in G and G 1 is different, the st-mincut includes the same edges for both graphs and thus induces the same partitioning of the graph. ...
doi:10.1007/978-3-642-12848-6_3
fatcat:sfd3k4rfargcfoog7f2r2yq2s4
Distributed Seams for Gigapixel Panoramas
2015
IEEE Transactions on Visualization and Computer Graphics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Current techniques based on multi-labeling Graph Cuts are too slow and memory intensive for gigapixel sized panoramas. ...
Our technique improves the time required to compute seams for gigapixel imagery from many hours (or even days) to just a few minutes, while still producing boundaries with energy that is on-par with Graph ...
The sending and receiving of messages are handled by a message passing engine, which internally uses MPI. ...
doi:10.1109/tvcg.2014.2366128
pmid:26357067
fatcat:ri3n7jhzvbfr3butrxxq2jwz2y
Topology-aware task mapping for reducing communication contention on large parallel machines
2006
Proceedings 20th IEEE International Parallel & Distributed Processing Symposium
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
However, for torus and grid networks now being used in large machines such as BlueGene/L and the Cray XT3, such contention becomes an issue. ...
We quantify the effect of this contention with benchmarks that vary the number of hops traveled by each communicated byte. ...
Even for a relatively moderate machine size messages might travel a large number of hops on average. ...
doi:10.1109/ipdps.2006.1639379
dblp:conf/ipps/AgarwalSLK06
fatcat:ya34op3xpbb6znqliew3htrlde
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
network constructed by (extended) breadth first search" -Y. ...
fax +420 2 2435 7385, phone +420 2 2435 7637, www: http://cmp.felk.cvut.cz "Needless to say, their version not only has its own real beauty, but is somewhat "sexy" running depth first search on the layered ...
Additionally, the gap heuristic has to take into account all nodes, unlike only the boundary nodes in S-ARD. msg -passing the messages (updating flow and labels on the boundary), discharge -work done by ...
doi:10.1007/978-3-642-23094-3_1
fatcat:cg66ldrypbagxddpktg7cfaosq
A Distributed Mincut/Maxflow Algorithm Combining Path Augmentation and Push-Relabel
[article]
2011
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The interaction between regions is considered expensive (regions are loaded into the memory one-by-one or located on separate machines in a network). ...
The algorithm works in sweeps - passes over all regions. Let B be the set of vertices incident to inter-region edges of the graph. ...
Additionally, the gap heuristic has to take into account all nodes, unlike only the boundary nodes in S-ARD. msg -passing the messages (updating flow and labels on the boundary), discharge -work done by ...
arXiv:1109.1146v1
fatcat:cnu35aurk5e4rnozvdctddxgx4
Multi-dimensional Parametric Mincuts for Constrained MAP Inference
[article]
2013
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose novel algorithms for inferring the Maximum a Posteriori (MAP) solution of discrete pairwise random field models under multiple constraints. ...
We show how this constrained discrete optimization problem can be formulated as a multi-dimensional parametric mincut problem via its Lagrangian dual, and prove that our algorithm isolates all constraint ...
Further, a number of heuristics or approximation algorithms based on belief propagation [34] , tree reweighted message passing [33] , and graph-cut [3] have also been proposed for the problem. ...
arXiv:1307.7793v1
fatcat:dfb3er6i5jaetmk7ntjyeadkdu
Scalable performance of ScaleGraph for large scale graph analysis
2012
2012 19th International Conference on High Performance Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
calculation) on Tsubame 2.0 distributed memory environment. ...
We make scalability evaluation by analyzing a synthetic Kronecker graph with 40.3 million edges (for all the three algorithms), and a real social network with 69 million edges (for degree distribution ...
ACKNOWLEDGMENT This research was supported by the Japan Science and Technology Agency's CREST project titled "Development of System Software Technologies for post-Peta Scale High Performance Computing" ...
doi:10.1109/hipc.2012.6507498
dblp:conf/hipc/DayarathnaHOS12
fatcat:bgptnzn26bae7m3mzdrisdnggm
Structured Learning and Prediction in Computer Vision
2010
Foundations and Trends in Computer Graphics and Vision
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Note that all edges now pass the message of type opposite of what they passed in the leaf-to-root phase. Thus, for each edge both message types are available. ...
Optimizing within N α (y) can be posed as a linear s − t-mincut problem on a suitably constructed directed graph, details can be found in . ...
However, it has a relatively weak convergence rate of O( √ ε) [Nedic and Bertsekas, 2000] , i.e. reducing the distance between w cur and w * by a factor of ε can require O( 1 ε 2 ) iterations. ...
doi:10.1561/0600000033
fatcat:zaj7fmxw4ngj7f7x63js7dkm2u
Benefits of Topology Aware Mapping for Mesh Interconnects
2008
Parallel Processing Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
By co-locating communicating tasks on nearby processors, the distance traveled by messages and hence the communication traffic can be minimized, thereby reducing communication latency and contention on ...
Applications running on these machines can benefit from topology-awareness while mapping tasks to processors at runtime. ...
This research also used running time on Blue Gene/P of the Argonne Leadership Computing Facility at Argonne National Laboratory, which is supported by the Office of Science of the U.S. ...
doi:10.1142/s0129626408003569
fatcat:xanlzwzqvngrxaj6bnptsvlmci
« Previous
Showing results 1 — 15 out of 70 results