Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"minimum cut"”.
-
Experimental study of minimum cut algorithms
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.
-
Minimum cut model for spoken lecture segmentation
… task aiming to optimize the normalized-cut criterion. Central to this framework is a contrastive analysis of lexical distribution that simultaneously optimizes the total similarity within each segment and dissimilarity across segments. Our experimental results show that the …
-
The Design and Analysis of Reliable Communication Networks
… of graphs with the smallest number of minimum cut sets. The number of minimum size vertex cut sets may give a much better indication of the reliability of the graph than the connectivity alone, at least where the probability of failure of a vertex is close to 0. The determination of the …
-
Shape Estimation Using Graph Cut
… problems which are solved using graph cut. Particularly, an approach called graph cuts based active contours (GCBAC) is proposed, and its applications to 2D object segmentation and three-dimensional (3D) object modeling are discussed. In the application of object segmentation, the …
-
Properties of p-modulus on radially symmetric infinite trees
… shortest path, effective resistance, and minimum cut. Some of these concepts have meaningful and interesting extensions to infinite graphs. For example, certain effective resistance calculations on infinite trees are known to be related to the transience or recurrence of random walks on …
-
Network security and min-cost max-flow problem
… Linear programming duality and the Max-Flow Min-Cut Theorem are applied to obtain properties that are satisfied in any Nash equilibrium. Using graph theoretic arguments, we give a characterization of the support of the equilibrium strategies. Finally, we study the conditions under which these …
-
Metodi di ottimizzazione dei processi produttivi applicati al settore dei lapidei carbonatici
… Path Method and Method of Maximum Flow and Minimum Cut. These methods represent a powerful analytical tool for help in the decisions that the technician must take both during the design of the activities, both in the case should monitor the activities already in progress in view of improving …
-
0-1 graph partitioning and image segmentation
… more partitions based on certain criteria. Graph cut techniques are used to partition a graph. The Minimum Cut method gives imbalanced partitions. To overcome the imbalanced partitioning, the Normalized Cut method is used. However, it is computationally expensive. The Isoperimetric Partitioning is …
-
Linear algebraic approaches to coding for multiple unicast networks
… some achievable regions using various minimum cut set values between the sources and destinations. Finally the cascaded decomposition of transfer matrices also allows us adopt a dynamic programming approach to coding for these networks. We revisit the original settings of the max-flow …
-
Fast algorithms for surface embedded graphs via homology
Made available in DSpace on 2014-01-16T17:54:48Z (GMT). No. of bitstreams: 3 Kyle_Fox.pdf: 3026914 bytes, checksum: c71a059d2688d88bc4678429df958563 (MD5) dissertation.zip: 35243792 bytes, checksum: 5c50fb8cf2afd614d071c635e5821a34 (MD5) license.txt: 4058 bytes, checksum: …
-
Combinatorial optimization on embedded curves
… on surfaces. We give algorithms to compute the minimum member of a given homology class, particularly computing the maximum flow and minimum cuts, in surface embedded graphs. We describe approximation algorithms to compute certain similarity measures for embedded curves on a surface. Finally, we …
-
Risk based models for the optimization of oil and gas supply chain critical infrastructure
… connectivity were analyzed using the risk based minimum cut-set model, and its associated algorithms and simulation, for tactical and short term planning. The impact of link failures, due to the risk and risk ratings associated with certain events and activities determined above, which can affect …
-
Graph-theoretic Identification of Dynamic Networks
… function are equivalent to the notion of minimum cut in an augmented graph resulted from systematically manipulating the graphical representation of the network. Then, the optimal set of auxiliary measurements minimizing the cost could be found using different approaches such as algorithms …
-
Object Association Across Multiple Moving Cameras In Planar Scenes
… function is maximized efficiently by finding the minimum cut of a capacitated graph. Experimental validation of the method is performed and presented on a diverse set of data. We then address the problem of associating objects across multiple cameras in planar scenes. Since cameras may be moving, …