Sentence examples for partitioning dynamic from inspiring English sources

Dynamic Partitioning Dynamic partitioning systems [15] are the systems where partitions are formed dynamically and change very frequently.

We analyse a new approach to bandwidth partitioning, Dynamic Bandwidth Partitioning.

We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning.

This paper presents an integer programming based partitioning of dynamic graphs that arise in power systems.

The three-dimensional compositional model CompFlow has been extended to allow the simulation of the multiphase advective, dispersive and diffusive flux of non-aqueous phase liquid (NAPL) contaminants in a discrete-fracture network, allowing for phase partitioning and dynamic interactions between the fracture network and the surrounding low-permeability rock matrix.

Table 3 Speedup comparison Implementation methods QCIF CIF SD HD Wavefront method 3.17 3.08 No No MBRP parallelism 3.32 3.32 3.32 No MBRP with data partitioning 3.8 3.7 3.68 3.54 Dynamic data partitioning 3.89 3.87 3.8 3.59 Our proposed method 3.954 3.954 3.959 3.959 Figure 18 PSNR vs. number of threads.

Also, methods that account for evolving structures (i.e. large numbers of shoring and frames in room partitions) and dynamic objects (i.e. equipment and human) are not reported in the literature.

Celik and Tjahjadi have recently proposed an adaptive image equalization algorithm [30] where the input histogram is first transformed into a Gaussian mixture model and then the intersection points of Gaussian components are used to partition the dynamic range of the image.

With the Four-Russians speedup, which partitions the dynamic programming table into blocks and looks up the distance of each block from a pre-computed block offset function, the edit distance can be computed in O(l 2 /log(l)) time when an appropriate block size is chosen (where l is the length of the two strings) [ 51].

The hash join technique is more efficient than the join mechanism of i2MapReduce which reads the record from the sorted static partition file and the sorted dynamic partition file and then joins them together.

In this paper, a method of dynamic partitioning area target was proposed and combined with the optimization greedy algorithm to optimize the partitioning result.