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 20 of 49 for “"minimum cut"”.
-
Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters
… sets, a covering problem consists of finding a minimum cost collection of elements that hits every set. This objective can always be bound by the maximum number of disjoint sets in the family, we refer to this as the covering dual, since when we allow covers to be fractional and relax the notion …
-
Minimum Cut-Sets for the Identification of Critical Water Distribution Network Segments
… segment in water distribution networks using minimum cut-sets. Through topological analysis, the minimum cut -set between the source node and each demand segment in the segment-vale representation of a given water distribution network was identified. The frequency of a segment appearing in all …
-
An Approximation Algorithm Based Approach to Instruction Scheduling
… problem which allows for deciding the execution order of instructions in a function without altering the function's semantics. By modifying instruction execution order, CPU resource usage can be maximized resulting in increased instruction throughput and decreased overall execution times. …
-
Combinatorial Algorithms for Submodular Function Minimization and Related Problems
… common in combinatorics; examples include the cut capacity function of a graph and the rank function of a matroid. The submodular function minimization problem generalizes the classical minimum cut problem and also contains a number of other combinatorial optimization problems as special cases. …
-
Defragmenting Social Networks
… solutions to which are NP-complete. The first, Minimum Cut, minimizes the number of edges with vertices on different partitions, known as the edge cut. The second, MIN_REPLICA, gives each master vertex a local replica of each neighbor that is on different partition, and rearranges the vertices …
-
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 …
-
Ordered optimal solutions and applications
… In particular, they explain the monotonicity of minimum cuts in parametric maximum flow problems in certain networks. However, in some parametric optimization problems, monotonicity does not hold. Rather, a totally ordered selection of optimal solutions exists. In Chapter 2, I present some …
-
Unsupervised learning in high-dimensional space
… data. We then propose the partition constrained minimum cut (PCut) framework based on a novel parametric graph construction method, that is shown to adapt to different degrees of imbalanced data. We analyze the limit cut behavior of our approach, and demonstrate the significant performance …
-
Algorithms for VLSI layout based on graph width metrics
… problems such as Gate Matrix Layout and Minimum Cut Linear Arrangement. Because these opti-mization problems are <i>NP</i>-Hard, and also because in practice the problems tend to be of bounded size, we address their fixed-parameter variants. Although recent advances in the field of …
-
lmprovement of Convergence in the Simulation of Complex Chemical Plants
… techniques. </p> <p> It is concluded that the Minimum Cut Streams criterion is the best to use for Direct Substitution, but that the use of the feasible Set criterion and Convergence Promotion will yield better convergence. The iterative improvement of convergence is discussed, and it is …
-
Optimization in graphs and networks
… into its overlapping subgraphs, and to find the cut sets and minimum cut sets in a graph.</p><p>Chapter III deals primarily with network flows. In particular, the problems of maximal flows in a network, and minimal cost flows are discussed.</p><p>Chapter IV presents flow charts and Fortran IV …
-
Efficient Data Structures for Partial Orders, Range Modes, and Graph Cuts
… order representation, range modes, and graph cuts. We consider two problems in partial order representation. The first is a data structure to represent a lattice. A lattice is a partial order where the set of elements larger than any two elements x and y are all larger than an element z, known …
-
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 …
-
Network flow algorithms and applications
… a look at a very important theorem. Maximum Flow/Minimum Cut Theorem. There is also a section on the Augmenting Path Algorithm. Chapter 4 Deals with shortest path problem. It includes Dijsksta's Algorithm and the All-Pairs Labeling Algorithm. Chapter 5 includes information on algorithms and …
-
GRAPH CUTS, SUM-OF-SUBMODULAR FLOW, AND LINEAR PROGRAMMING: EFFECTIVE INFERENCE IN HIGHER-ORDER MARKOV RANDOM FIELDS
… A notable example of this is Graph Cuts, in which the minimum-cut problem is used to solve a class of vision problems known as first-order Markov Random Fields. Despite this success, first-order MRFs have their limitations. They cannot encode correlations between groups of pixels …
-
An Investigation into Segmenting Traffic Images Using Various Types of Graph Cuts
In computer vision, graph cuts are a way of segmenting an image into multiple areas. Graphs are built using one node for each pixel in the image combined with two extra nodes, known as the source and the sink. Each node is connected to several other nodes using edges, and each edge has a specific …
-
Grafais paremta vaizdų analizė /
… clustering algorithms: SLIC, SLICO, MSLIC and minimum spanning tree algorithm – Felzenszwalb-Huttenlocher. Both segmenting methods are searching for minimum cut in graph. Boykov-Kolmogorov creates search trees, while the push-relabel algorithm creates residual graph. In the second half of this …
-
Outlier Detection By Network Flow
… in this dissertation. It uses the Maximum Flow Minimum Cut theorem from graph theory to find the outliers and strong outlier groups, and evaluate the outliers by outlier degrees. This algorithm uses k-nearest neighbors to find density connected points of the dataset. Data relationships are …
-
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 …
-
Optimal Network Maintenance and Restoration: Applications and Algorithms
… at each state to failed edges that appear in a minimum source-sink cut. In Chapter 3, we consider a selective maintenance maximum flow (SM-MF) problem where edge failures occur probabilistically in each time period. Similar to IND-MF, we apply a maskable proximal policy optimization (M-PPO) RL …
Page 1 of 3