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 51 for “"PARTITIONING ALGORITHMS"”.

  1. Partitioning algorithms for induced subgraph problems

    … dissertation introduces the MCSPLIT family of algorithms for two closely-related NP-hard problems that involve finding a large induced subgraph contained by each of two input graphs: the induced subgraph isomorphism problem and the maximum common induced subgraph problem. The MCSPLIT algorithms …

    glasgow Repository record for Partitioning algorithms for induced subgraph problems (opens in a new tab) Download PDF for Partitioning algorithms for induced subgraph problems (opens in a new tab)

  2. Partitioning algorithms for parallel circuit simulation

    … an opportunity to speed up the simulation by partitioning the circuit so that the computation may be spread among the processors. To accomplish this, the circuit is partitioned into subcircuits using a node tearing method. If the circuit matrix is ordered subcircuit by subcircuit followed by …

    uiuc Repository record for Partitioning algorithms for parallel circuit simulation (opens in a new tab)

  3. Spatial Partitioning Algorithms for Solving Location-Allocation Problems

    This dissertation presents spatial partitioning algorithms to solve location-allocation problems. Location-allocations problems pertain to both the selection of facilities to serve demand at demand points and the assignment of demand points to the selected or known facilities. In the first part of …

    unt Repository record for Spatial Partitioning Algorithms for Solving Location-Allocation Problems (opens in a new tab)

  4. Some Graph Partitioning Algorithms based on belief propagation

    … project we have focused on a kind of graph partitioning problem com- monly called bi-categorical clustering, however, we also show that all results are easily extended to general graph partitioning. In this problem we get a graph asked to output a partitioning and such that the partitions …

    chalmers Repository record for Some Graph Partitioning Algorithms based on belief propagation (opens in a new tab)

  5. Materialisation and data partitioning algorithms for distributed RDF systems

    … in the cluster. Second, we present two new algorithms for partitioning RDF data, both of which aim to produce tightly connected partitions, but without loading complete datasets into memory. We evaluate our materialisation algorithm against two state-of-the- art distributed Datalog systems …

    oxford Repository record for Materialisation and data partitioning algorithms for distributed RDF systems (opens in a new tab)

  6. Geometric partitioning algorithms for fair division of geographic resources

    … interested in \emph{map segmentation problem} of partitioning a geographic region into smaller subregions for allocating resources or distributing a workload among multiple agents. This work would result in useful solutions for a variety of fundamental problems, ranging from congressional …

    umn Repository record for Geometric partitioning algorithms for fair division of geographic resources (opens in a new tab)

  7. Analysis of Concordance of Different Haplotype Block Partitioning Algorithms

    Different classes of haplotype block partitioning algorithms exist and the ideal dataset to assess their performance would be to comprehensively re-sequence entire sets of chromosomes from a large population of unrelated individuals. Such a dataset is prohibtively expensive to collect. …

    marquette Repository record for Analysis of Concordance of Different Haplotype Block Partitioning Algorithms (opens in a new tab)

  8. An Investigation Into Partitioning Algorithms for Automatic Heterogeneous Compilers

    … team, but limited research exists on current partitioning algorithms responsible for separating hardware and software. The purpose of this thesis is to implement various partitioning algorithms onto the same automatic heterogeneous compiler platform to create an apples to apples comparison for …

    calpoly Repository record for An Investigation Into Partitioning Algorithms for Automatic Heterogeneous Compilers (opens in a new tab)

  9. Developments and experimental evaluation of partitioning algorithms for adaptive computing systems

    … CHAMPION backend design flow, which includes the partitioning problem, netlist to structural VHDL conversion, synthesis and placement and routing, and host code generation. The primary goal is to investigate the development and evaluation of three different k-way partitioning approaches. In the …

    utk-theses Repository record for Developments and experimental evaluation of partitioning algorithms for adaptive computing systems (opens in a new tab)

  10. ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΓΡΑΜΜΙΚΗΣ ΕΚΤΙΜΗΣΗΣ-ΣΥΓΚΡΙΤΙΚΗ ΥΠΟΛΟΓΙΣΤΙΚΗ ΑΝΑΛΥΣΗ

    THIS THESIS IS DEALING WITH LINEAR ESTIMATION PARTITIONING ALGORITHMS, FOR DISCRETE TIME SYSTEMS. FOUR NEW RECURSIVE PER- SAMPLE PARTITIONING ESTIMATION ALGORITHMS ARE INITIALY PRESENTED, AND THE RELATED MERITS, WITH RESPECT TO THEIR COMPUTATIONAL REQUIREMENTS ARE EXAMINED AGAINST THREE OTHER …

    greece Repository record for ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΓΡΑΜΜΙΚΗΣ ΕΚΤΙΜΗΣΗΣ-ΣΥΓΚΡΙΤΙΚΗ ΥΠΟΛΟΓΙΣΤΙΚΗ ΑΝΑΛΥΣΗ (opens in a new tab)

  11. Cost-based partitioning for distributed simulation of hierarchical modular DEVS models

    … is to design and implement a class of generic partitioning algorithms for hierarchical, modular Discrete Event Specification System (DEVS) models for distributed simulation. To attain the goal of this dissertation, a set of partitioning algorithms is designed using the cost analysis …

    arizona-thes Repository record for Cost-based partitioning for distributed simulation of hierarchical modular DEVS models (opens in a new tab)

  12. Object Detection Using Efficient Partitioning and Frame Reduction

    … of object detection through efficient data partitioning, frame reduction techniques, and parallel processing. Techniques to improve the performance of Spark’s default partitioning algorithms by creating more evenly distributed partitions based on the estimated workload of the frames are …

    carleton Repository record for Object Detection Using Efficient Partitioning and Frame Reduction (opens in a new tab)

  13. PPDQ-BG: Parallel Partition and Distributed Query Processing for Big Graphs

    … of finding relevant relations from big graphs or partitioning a big graph into several meaningful inter-connected graph partitions. In this thesis, we propose a scalable framework, “Parallel Partition and Distributed Query Processing for Big Graphs” (PPDQ-BG) that aims to achieve a parallel …

    umkc Repository record for PPDQ-BG: Parallel Partition and Distributed Query Processing for Big Graphs (opens in a new tab)

  14. Partitioning and distribution of web applications to the hybrid cloud

    … attempted to address this complexity by using partitioning algorithms to optimize distribution and deployment of code entities across public cloud and private infrastructure. However, we have identified the following shortfalls with the existing research work: Current research does not provide …

    ubc Repository record for Partitioning and distribution of web applications to the hybrid cloud (opens in a new tab) Download PDF for Partitioning and distribution of web applications to the hybrid cloud (opens in a new tab)

  15. Star bi-coloring of bipartite graphs

    … reduces the computational cost. Bi-directional partitioning to determine non-zeroes in the sparse matrix works better than unidirectional partitioning for dense rows and dense columns. We have developed a bidirectional coloring algorithm that determines all the non-zeroes of a sparse Jacobian …

    lethbridge Repository record for Star bi-coloring of bipartite graphs (opens in a new tab)

  16. A distributed workload-aware approach to partitioning geospatial big data for cybergis analytics

    … applications. However, previous work on partitioning large geospatial data focuses on bulk-ingestion and static partitioning, hence is unable to handle dynamic variability in both data and computation that are particularly common for streaming data. To eliminate this limitation, this …

    uiuc Repository record for A distributed workload-aware approach to partitioning geospatial big data for cybergis analytics (opens in a new tab)

  17. Towards more power efficient IP lookup engines

    … The second stream focuses on routing table partitioning. This work proposes to bridge the gap by employing strategies to combine these two leading state of the art schemes. The existing partitioning algorithms are generally employed on a binary routing trie precluding their application to a …

    tamu Repository record for Towards more power efficient IP lookup engines (opens in a new tab)

  18. The development of "clinically sensible" tools to screen for cognitive impairment in community-dwelling elderly persons. Bridging the gap between research and clinical practice by balancing discriminant ability vs. practicality.

    … derived from logistic regression and recursive partitioning analyses which most closely approximated the sensitivity and specificity of the entire 3MS were externally validated. Results. Two logistic regression based scales and two recursive partitioning algorithms demonstrated sensitivities and …

    ottawa-retro Repository record for The development of "clinically sensible" tools to screen for cognitive impairment in community-dwelling elderly persons. Bridging the gap between research and clinical practice by balancing discriminant ability vs. practicality. (opens in a new tab)

Page 1 of 3