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 16 of 16 for “"Partitioning Algorithms"”.
-
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 …
-
Network partitioning algorithms for electricity consumer clustering
In many developing countries, access to electricity remains a significant challenge. Electrification planners in these countries often have to make important decisions on the mode of electrification and the planning of electrical networks for those without access, while under resource constraints. …
-
ΑΛΓΟΡΙΘΜΟΙ ΔΙΑΜΕΛΙΣΜΟΥ ΓΡΑΜΜΙΚΗΣ ΕΚΤΙΜΗΣΗΣ-ΣΥΓΚΡΙΤΙΚΗ ΥΠΟΛΟΓΙΣΤΙΚΗ ΑΝΑΛΥΣΗ
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 …
-
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 …
-
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 …
-
An adaptive partitioning scheme for ad-hoc and time-varying database analytics
Data partitioning significantly improves query performance in distributed database systems. A large number of techniques have been proposed to efficiently partition a dataset, often focusing on finding the best partitioning for a particular query workload. However, many modern analytic applications …
-
An effective algorithm for multiway hypergraph partitioning
The problem of hypergraph partitioning has been around for more than a quarter of a century. Its early applications were centered on VLSI circuit design. In recent years, the application of hypergraph partitioning has been extended into the areas including data classifications, efficient storage of …
-
Learning on Inhomogeneous Hypergraphs
… EDVWs, based on which I propose spectral partitioning algorithms for co-clustering vertices and hyperedges. Second, I develop a framework for incorporating EDVWs into hypergraph cut problems via introducing a new class of hyperedge splitting functions which are both submodular and …
-
Ordering Strategies for Sparse Matrices in Chemical Process Simulation
… include local heuristic strategies, graph, partitioning techniques, and iterative methods. These methods were compared with previously used orderings, in terms of structural criteria, solution time, and parallel speedup. For the one processor frontal method, the local heuristic ordering RMCD …
-
Development of new data partitioning and allocation algorithms for query optimization of distributed data warehouse systems
… need to be accessed from storage disks. Data partitioning is one of the physical design techniques that may be used to optimize query processing cost in DWs. It is a non redundant optimization technique because it does not replicate data, contrary to redundant techniques like materialized …
-
Garbage collection of the PLAVA object store
… PLaVa store, in order to support semispace and partitioning algorithms. The partitioned collection scheme in particular required almost a complete re-implementation of the store. To evaluate the implemented garbage collection schemes, a synthetic application was developed, which allowed the fine …
-
Multilevel spectral clustering : graph partitions and image segmentation
While the spectral graph partitioning method gives high quality segmentation, segmenting large graphs by the spectral method is computationally expensive. Numerous multilevel graph partitioning algorithms are proposed to reduce the segmentation time for the spectral partition of large graphs. …
-
Algorithms for Vertex-Weighted Matching in Graphs
… and to coarsen graphs in multi-level graph partitioning algorithms. In the first part of this thesis, we develop exact and approximation algorithms for vertex weighted matchings, an under-studied variant of the weighted matching problem. We propose three exact algorithms, three half …
-
Computational intelligent systems : evolving dynamic Bayesian networks
… actuators; adaptive operators; representative partitioning algorithms which facilitate the scalability framework; formal development and optimization of genetic algorithm (GA) to emerge optimal Bayesian networks from datasets, with emphasis on backtracking avoidance; and diverse applications of …
-
Speeding up stochastic block partitioning with graph coloring
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2025-05-01
-
Algorithms for new objectives in graph partitioning and generalizations
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms