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 18 of 18 for “"Max-flow"”.
-
Network security and min-cost max-flow problem
… operations research problems such as the maximum flow problem, the shortest path problem, and the network interdiction problem. However, in environments where network components are subject to adversarial failures, the network operator needs to strategically allocate at least some of her …
-
Flow Optimization in Dynamic and Continuous Networks (Polymatroids, Submodular, Max-Flow Min-Cut)
… is designated to be the destination, and a (tau)-maximum flow is defined to be a routing assignment which maximizes the amount of commodity reaching the destination before time (tau). The key discovery used to solve the problem is that a routing assignment has minimum delay if and only if it is a …
-
A Cut Search Approach to Max-Flow Min-Cut Problems and Cost Duration Analysis
Made available in DSpace on 2014-12-10T22:48:28Z (GMT). No. of bitstreams: 1 7511768.pdf: 4337186 bytes, checksum: 5b3e63b676ddd12f803feeb93c630ba0 (MD5) Previous issue date: 1974
-
Optimization of Markov Random Fields in Computer Vision
… methods. First, we introduce a memory efficient max-flow algorithm for multi-label submodular MRFs. In fact, such MRFs have been shown to be optimally solvable using max-flow based on an encoding of the labels proposed by Ishikawa, in which each variable $X_i$ is represented by $\ell$ nodes …
-
Optimization of Markov Random Fields in Computer Vision
… methods. First, we introduce a memory efficient max-flow algorithm for multi-label submodular MRFs. In fact, such MRFs have been shown to be optimally solvable using max-flow based on an encoding of the labels proposed by Ishikawa, in which each variable $X_i$ is represented by $\ell$ nodes …
-
Cheeger sets for unit cube : analytical and numerical solutions for L [infinity] and L² norms
… for measuring IIDII. We look at the equivalent max-flow min-cut problem for continuum flows, and use it to get numerical results for the problem. We then use these results to suggest analytical solutions to the problem and optimize these shapes using calculus and numerical methods. Finally we …
-
Fundamental limit of network flow attacks
A network flow-based attack refers to a cyber-attack where the adversary seeks to block user traffic from transmission by sending adversarial traffic that reduces the available user capacity. In this thesis, we explore the fundamental limits of network flow attacks by investigating its feasibility …
-
Topics in multi-terminal wireless networks
… be equivalent to characterizing an information flow for the wireless network. A nodeflow for a graph with bisubmodular capacity constraints is presented and a max-flow min-cut theorem is presented. This generalizes many well-known results of flows over capacity constrained graphs studied in …
-
A Sparsification Based Algorithm for Maximum-Cardinality Bipartite Matching in Planar Graphs
… the one of special interest to us being the Maximum Cardinality Bipartite Matching in Planar Graphs. In this work, we present a novel sparsification based approach for computing maximum/perfect bipartite matching in planar graphs. The overall complexity of our algorithm is O(n<sup>6/5</sup> …
-
Layering principles for wireless networks
… understanding the capacity, i.e., the maximum information rate supported by wireless networks, is a central aim in the field of information theory. This understanding has been successfully obtained for the case of small canonical networks (called channels, for example, broadcast, …
-
Accelerating human-in-the-loop machine learning
Machine learning workflow development is a process of trial-and-error: developers iterate on workflows by testing out small modifications until the desired accuracy is achieved. Unfortunately, existing machine learning systems focus narrowly on model training—a small fraction of the overall …
-
On the robustness of network infrastructures to disasters and physical attacks
… the locations of a disaster that would have the maximum disruptive effect on a network in terms of capacity and connectivity. We consider graph models in which nodes and links are geographically located on a plane, and model the disaster event as a line segment or circular disk. We develop …
-
Higher-Order Regularization in Computer Vision
… derivatives. Another topic is the parametric max-flow problem. An analysis is given, showing its inherent limitations for large-scale problems which are common in computer vision. The thesis also introduces a segmentation approach for finding thin and elongated structures in 3D volumes. Using …
-
Optimising Networks For Ultra-High Definition Video
… of current static video delivery systems, an OpenFlow based migration system is proposed. This system enables an almost seamless migration of a transcoder or ALM node, while delivering real-time ultra-high definition content. Further to this, a novel heuristic algorithm is presented to optimise …
-
Linear algebraic approaches to coding for multiple unicast networks
… We revisit the original settings of the max-flow min-cut theorem and provide an alternative proof that is based purely on linear algebraic coding constructions. Using the same intuition, we devise a recurisve coding algorithm for two-unicast-Z networks. We hope that our approaches do not …
-
Optimizing for a Many-Core Architecture without Compromising Ease-of-Programming
… More concretely, we: (1) present a work-flow guiding programmers to produce efficient parallel solutions starting from a high-level problem; (2) introduce an analytical performance model for XMT programs and provide a methodology to project running time from an implementation; (3) propose …
-
Towards Data-Driven I/O Load Balancing in Extreme-Scale Storage Systems
… and applies Markov chain modeling and a dynamic maximum flow algorithm to decide where data should be placed in a load-balanced fashion. Evaluation using a realistic system simulator shows that our approach yields better load balancing, which in turn can help yield higher end-to-end performance.
-
Routing algorithms for electronic design automation
… bus within the component such that the resultant maximum density (a good indicator of the number of layers needed) is minimized. We prove that REP is NP-complete, and show that it can be formulated as an integer linear program (ILP). A provably good approximation algorithm for the REP is developed …