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 8 of 8 for “"Max-flow algorithm"”.

  1. Branch-decomposition heuristics for linear matroids

    … new heuristics which utilize classification and max-flow algorithm respectively to derive near-optimal branch-decompositions for linear matroids. In the literature, there are already excellent heuristics for graphs, however, no practical branch-decomposition methods for general linear matroids …

    rice Repository record for Branch-decomposition heuristics for linear matroids (opens in a new tab)

  2. Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization

    … For general connectivity, the fastest known algorithms take time O(mn) [Henziner, Rao and Gabow FOCS'96] and O(T(n)+nT(k)) [Linial, Lovász, Wigderson FOCS'86] where T(n) is the time to multiply two n-by-n matrices. Even for the special case when k = O(1) and m = O(n), both algorithms run at …

    aalto Repository record for Vertex Connectivity via Local Computation: Breaking Quadratic Time, Poly-logarithmic Max-flows, and Derandomization (opens in a new tab)

  3. A reliability assessment methodology for distribution systems with distributed generation

    … and combines that with a path augmenting Max flow algorithm to evaluate the load status for each state change of operation in the system. Overall system and load point reliability indices such as hourly loss of load, frequency of loss of load and expected energy unserved can be computed …

    tamu Repository record for A reliability assessment methodology for distribution systems with distributed generation (opens in a new tab)

  4. Optimization of Markov Random Fields in Computer Vision

    … between them. In this thesis, we present new algorithms to perform inference in MRFs, that are either more efficient (in terms of running time and/or memory usage) or more effective (in terms of solution quality), than the state-of-the-art methods. First, we introduce a memory efficient …

    anu Repository record for Optimization of Markov Random Fields in Computer Vision (opens in a new tab)

  5. Phase unwrapping of 4D-flow MRI data with graph cuts.

    … issue when measuring velocity utilizing 4D flow magnetic resonance imaging (MRI) is aliasing that occurs because of a low velocity encoding parameter (VENC). Aliasing can be avoided if the velocity encoding parameter is set above the largest velocity quantity. However, when this is done the …

    louisville Repository record for Phase unwrapping of 4D-flow MRI data with graph cuts. (opens in a new tab)

  6. 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 …

    essex Download PDF for Optimising Networks For Ultra-High Definition Video (opens in a new tab)

  7. Optimizing for a Many-Core Architecture without Compromising Ease-of-Programming

    … foundation and an aggressive scalable design. Algorithmically, XMT is inspired by the PRAM (Parallel Random Access Machine) model and the architecture design is focused on reducing inter-task communication and synchronization overheads and providing an easy-to-program parallel model. This …

    maryland Repository record for Optimizing for a Many-Core Architecture without Compromising Ease-of-Programming (opens in a new tab)

  8. 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.

    vt Repository record for Towards Data-Driven I/O Load Balancing in Extreme-Scale Storage Systems (opens in a new tab)