Essays about: "Partitionering"

Showing result 1 - 5 of 14 essays containing the word Partitionering.

1. 1. Complexity Analysis and Structural Optimization for Architecture Models of Mechatronic Systems

   University essay from KTH/Skolan för industriell teknik och management (ITM)

   Author : Yuanyang Zhang; [2023]
   Keywords : Mechatronic System Design; Architecture Model; DSM; Structural Complexity; Partitioning Optimization Design; Mekatronisk Systemdesign; Arkitektur Modell; DSM; Strukturell Komplexitet; Partitionering Optimering Design;

   Abstract : The design and development of mechatronic system are becoming an increasingly complex task due to the numerous disciplines involved, rapidly increasing scales, and the integration issues of different domains and technologies. The structural complexity of the architecture model design decides the quality of system design in many aspects: the scalability of the system design; usage of allocated resources which influences the computational overhead, etc. READ MORE

3. 2. Resource-efficient and fast Point-in-Time joins for Apache Spark : Optimization of time travel operations for the creation of machine learning training datasets

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Axel Pettersson; [2022]
   Keywords : Apache Spark; Point-in-Time; ASOF; Join; Optimizations; Time travel; Apache Spark; Point-in-Time; ASOF; Join; Optimeringar; Tidsresning;

   Abstract : A scenario in which modern machine learning models are trained is to make use of past data to be able to make predictions about the future. When working with multiple structured and time-labeled datasets, it has become a more common practice to make use of a join operator called the Point-in-Time join, or PIT join, to construct these datasets. READ MORE

4. 3. Reducing the computational complexity of a CNN-based neural network used for partitioning in VVC compliant encoders

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Saman Rassam; [2022]
   Keywords : Video Coding; VVC; Block Partitioning; VTM; ANN; CNN; Videkodning; VVC; Blockpartitionering; VTM; ANN; CNN;

   Abstract : Block partitioning is a computationally heavy step in the video coding process. Previously, this stage has been done using a full-search-esque algorithm. READ MORE

5. 4. Near-linear time expander decomposition in practice

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Isaac Arvestad; [2022]
   Keywords : ;

   Abstract : An expander decomposition is a partitioning of vertices such that each partition is an induced expander. Recently Saranurak and Wang [SW19] gave a randomized algorithm for computing expander decompositions in O(Ø-1m log4m) time. This was the first near linear time algorithm with respect to the number of edges m. READ MORE

6. 5. Comparison of spatial partitioning data structures in crowd simulations

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Jakob Kratz; Viktor Luthman; [2021]
   Keywords : Radius Search; Spatial Partitioning; Agent- Based Simulation; Boids; Grid; Kd- Tree; Quadtree; Maximum Velocity; Radius Search; Spatial Partitioning; Agent- Based Simulation; Boids; Grid; Kd- Tree; Quadtree; Maximum Velocity;

   Abstract : This report investigates how the construction and query time of multiple spatial partitioning data structures is impacted by spatial distribution of and number of agents in a crowd simulation. In addition a method is investigated for updating the data structures less frequently at the cost of increasing the radius queried, without affecting the correctness of the queries. READ MORE