dgim alternatives and similar packages
Based on the "Algorithms" category.
Alternatively, view dgim alternatives based on common mentions on social networks and blogs.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
lca
Improves the known complexity of online lowest common ancestor search to O(log h) persistently, and without preprocessing -
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
edit-distance-linear
Levenshtein edit distance in linear memory (also turns out to be faster than C++) -
InfluxDB – Built for High-Performance Time Series Workloads
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of dgim or a related project?
README
haskell-dgim
This is a Haskell implementation of the Datar-Gionis-Indyk-Motwani algorithm for approximately counting occurences of certain elements in a (very large) prefix of a (possibly infinite) stream.
Installation
This package is now available on Hackage with the name dgim:
cabal install dgim
or by name in your .cabal file. However, it is in the alpha stage and the API is likely to change in the future.
Bleeding edge
Install cabalg, if you do not already have it with cabal install cabalg.
cabalg https://github.com/musically-ut/haskell-dgim