Search Results for "sorting algorithm"

The DISTOD data profiling algorithm is a distributed algorithm to discover bidirectional order dependencies (in set-based form) from relational data. DISTOD is based on the single-threaded FASTOD-BID algorithm [1], but DISTOD scales elastically to many machines outperforming FASTOD-BID by up to orders of magnitude. Bidirectional order dependencies (bODs) capture order relationships between lists of attributes in a relational table.

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. ...

...In particular, it allows the user to measure the volume of all distinguishable features in an image and to isolate and sort those particles. As the name implies, LAVA uses Lloyd's Algorithm, also known as k-means sorting, to identify a small set of volumes representative of the actual distribution of particle in the image. Although developed for determining feature volume, LAVA is also completely compatible with other types of image analysis, such as fluorescence intensity. Work is in progress to provide three-channel functionality, allowing comparison of relative intensity of red, green, and blue channels in multi-color images.

The Hardware Assisted Visibility Sorting (HAVS) algorithm is a GPU-based, direct volume renderer for unstructured grids. The algorithm operates in both object- and images-space and includes a sample-based, dynamic level-of-detail algorithm.