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.
Filters
Power Watershed: A Unifying Graph-Based Optimization Framework
2011
IEEE Transactions on Pattern Analysis and Machine Intelligence
Preserved Fulltext
In this work, we extend a common framework for graph-based image segmentation that includes the graph cuts, random walker, and shortest path optimization algorithms. ...
Placing the watershed algorithm in this energy minimization framework also opens new possibilities for using unary terms in traditional watershed segmentation and using watershed to optimize more general ...
ACKNOWLEDGMENT We would like to thank Jean Cousty for the numerous interesting and fruitful discussions. ...
doi:10.1109/tpami.2010.200
pmid:21079274
fatcat:k2kfp7go3rafloelx3paun7p2m
Efficient 3D stereo vision stabilization for multi-camera viewpoints
2019
Bulletin of Electrical Engineering and Informatics
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.
Then improved the connectivity of correct matching pairs by minimizing the global error using spanning tree algorithm. ...
Tree algorithm helps to stabilize randomly positioned camera viewpoints in linear order. The unique matching key-points will be calculated only once with our method. ...
Minimum Spanning Tree (MST) is an undirected connected graph where we can find a tree or relation with minimum number of edges. ...
doi:10.11591/eei.v8i3.1518
fatcat:nsuidbv3q5eqppwjd3gxac5tla
Page 1063 of Mathematical Reviews Vol. , Issue 95b
[page]
1995
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Stephen Suen] and Eli Upfal, Optimal construction of edge-disjoint paths in random graphs (603-612); Rajeev Raman and Uzi Vishkin, Optimal randomized parallel algorithms for com- puting the row maxima ...
Ravi, Spanning trees short or small (546-555); Guy Kortsarz and David Peleg, Generating low-degree 2-spanners (556-563); Micah Adler, Peter Gemmell, Mor Harchol- Balter, Richard M. ...
Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP
2002
Algorithmica
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.
list ranking, (2) Euler tour construction in a tree, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree evaluation ...
In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well-known graph problems: (1) ...
Santoro, and I. Rieping for their helpful discussions on the first version of this paper [5] . ...
doi:10.1007/s00453-001-0109-4
fatcat:luwfutwv3vaazixhpsqoy4hpee
Efficient parallel graph algorithms for coarse grained multicomputers and BSP
[chapter]
1997
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.
list ranking, (2) Euler tour construction in a tree, (3) computing the connected components and spanning forest, (4) lowest common ancestor preprocessing, (5) tree contraction and expression tree evaluation ...
In this paper we present deterministic parallel algorithms for the coarse-grained multicomputer (CGM) and bulk synchronous parallel (BSP) models for solving the following well-known graph problems: (1) ...
Santoro, and I. Rieping for their helpful discussions on the first version of this paper [5] . ...
doi:10.1007/3-540-63165-8_195
fatcat:wvubewx4nfb3zlv2gr6fqqb7f4
A genetic algorithm for finding microgrid cable layouts
2022
Proceedings of the Thirteenth ACM International Conference on Future Energy Systems
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 2022; you can also visit the original URL.
The file type is application/pdf.
The goal is to find a cost-minimal cable layout that connects these locations and that is sufficient to handle the consumer demands. ...
An evaluation on a set of benchmark instances indicates that this algorithm is able to find good solutions within a short amount of time. ...
The authors would further like to thank Sascha Gritzbach for helpful discussions on the algorithms and their presentation. ...
doi:10.1145/3538637.3538835
fatcat:wpgamgsprvg5rldlm4gnvgxhxu
Approximation Algorithms for the Asymmetric Traveling Salesman Problem : Describing two recent methods
[article]
2014
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.
constructing a maximum entropy spanning tree from a spanning tree polytope and then finally defining the thin-ness property and transforming a thin spanning tree into an Eulerian walk. ...
[2], gives an O( n/ n) randomized algorithm for the ATSP, by symmetrizing and modifying the solution of the Held-Karp relaxation problem and then proving an exponential family distribution for probabilistically ...
Given, values λ e ≥ 0, for all edges e ∈ E, a λ-random tree T of the graph G is a tree chosen from the set of all spanning trees of G, with a probability which is proportional to the product of the values ...
arXiv:1405.1781v1
fatcat:pdyarmzrfzgwtd5tmf5lnizmde
An Efficient Multicast Routing Technique Using Genetic Algorithm over WDM Mesh Networks
2015
Journal of Advances in Computer Networks
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.
In this paper we have used Genetic Algorithm to find an efficient multicast route (tree) to establish a multicast connection in WDM mesh network. ...
We have proposed a novel fitness function which can optimize multiple objectives: reaching maximum no. of destinations, minimizing usage of optical channels, minimizing usage of splitters, very efficiently ...
In graph theory, the MST problem is defined as a problem to find a minimally connected tree which spans over a selected set of nodes. ...
doi:10.7763/jacn.2015.v3.142
fatcat:6c7p3yzm45bavacef2xg6gukai
A parallel algorithm for computing Steiner trees in strongly chordal graphs
1994
Discrete Applied Mathematics
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.
We present an efficient parallel algorithm for the computation of a minimum Steiner tree for any strongly chordal graph. ...
The algorithm works in O(log' n) time and uses a linear number of processors provided a strongly perfect elimination ordering is given. ...
To get a minimum Steiner tree, we only have to compute a spanning tree for G restricted to IV'. ...
doi:10.1016/0166-218x(94)90093-0
fatcat:3rx5znqrtrgthilpc2ariqohga
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
2008
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
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 performance of heuristics for minimum cost fusion are evaluated through theory and simulations, showing a significant saving in routing costs, when compared to routing all the raw measurements to the ...
The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. ...
Bisdikian and Y. Sharma for extensive discussions. ...
doi:10.1109/infocom.2008.129
dblp:conf/infocom/AnandkumarTSE08
fatcat:3tjt2eu5zne4ni3ikh4rsxr6pm
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
2008
2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications
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 performance of heuristics for minimum cost fusion are evaluated through theory and simulations, showing a significant saving in routing costs, when compared to routing all the raw measurements to the ...
The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. ...
Bisdikian and Y. Sharma for extensive discussions. ...
doi:10.1109/infocom.2007.129
fatcat:jc4ribcdt5ewnhsgvrenr2wcq4
New primal and dual matching heuristics
1995
Algorithmica
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.
Matching, Heuristics, Moat packing, Minimum spanning tree. 1. Introduction. ...
running time for an n node problem is O(n log n) after a minimum-cost spanning tree is constructed. ...
We would like to thank Doris Zepf of the University of Augsburg for coding and debugging the quaternary bucketing algorithm for the Delaunay triangulation, Bill Cook of Bellcore for solving the 4026-point ...
doi:10.1007/bf01293485
fatcat:i2l5xlp4prdn5g6hzqdvpg3fqe
A Progressive Approach to Scalar Field Topology
[article]
2021
IEEE Transactions on Visualization and Computer Graphics
accepted
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.
Other Versions
algorithms and we describe further accelerations with shared-memory parallelism. ...
of the data and for which we show that no computation is required as they are introduced in the hierarchy. ...
ACKNOWLEDGMENTS We would like to thank the reviewers for their thoughtful remarks and suggestions. ...
doi:10.1109/tvcg.2021.3060500
pmid:33606631
arXiv:2007.14766v2
fatcat:bmjyymbuizcahlfaabn3pgi5hy
I/O-efficient batched union-find and its applications to terrain analysis
2010
ACM Transactions on Algorithms
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.
If there are union operations that join a set with itself, our algorithm uses O(SORT(N ) + MST(N )) I/Os, where MST(N ) is the number of I/Os needed to compute the minimum spanning tree of a graph with ...
We develop I/O-efficient algorithms for the problem and use them to develop I/O-efficient topological persistence and contour tree algorithms. ...
In this section, we report some preliminary experimental results of our algorithm in the context of some of its applications. ...
doi:10.1145/1868237.1868249
fatcat:bq3qd4crifh3tfmh65kz7fapmi
I/O-efficient batched union-find and its applications to terrain analysis
2006
Proceedings of the twenty-second annual symposium on Computational geometry - SCG '06
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.
If there are union operations that join a set with itself, our algorithm uses O(SORT(N ) + MST(N )) I/Os, where MST(N ) is the number of I/Os needed to compute the minimum spanning tree of a graph with ...
We develop I/O-efficient algorithms for the problem and use them to develop I/O-efficient topological persistence and contour tree algorithms. ...
In this section, we report some preliminary experimental results of our algorithm in the context of some of its applications. ...
doi:10.1145/1137856.1137884
dblp:conf/compgeom/AgarwalAY06
fatcat:otxn4cbhpzazpiwwjubpzjpxry
« Previous
Showing results 1 — 15 out of 3,217 results