• 1
  • HeatMiner

    HeatMiner is a visual data mining technology developed by Agience Oy Ltd. It takes raw numeric data as input and generates 2- or 3-dimensional heatmaps to your web page or application which can be rotated and zoomed with mouse and saved as high-quality heatmap images. HeatMiner heatmaps are pure vector graphics giving superior b...

    MORE...

    nextarrow.png
  • DataZips

    DataZips is a collection of general purpose data indexing and querying algorithms. The core idea is to provide a common interface for making queries to potentially very large data sets to get a subset of the data needed by some data refining algorithm or application. The results are delivered as a zip file containing the selecte...

    MORE...

    nextarrow.png
  • Quicksort

    Quicksort (sometimes called partition-exchange sort) is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by Tony Hoare in 1959, with his work published in 1961, it is still a commonly used algorithm for sorting. When implemented well, it can be about two or t...

    MORE...

    nextarrow.png
  • Merge sort

    In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that...

    MORE...

    nextarrow.png
  • Bucket sort

    Bucket sort, or bin sort, is a sorting algorithm that works by distributing the elements of an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, and is a cousin of radix sort in t...

    MORE...

    nextarrow.png