Link Details

A few days ago, Yasuhiro published an article on Flower Filter. The main motivation of Flower Filter is that we need a data structure that remembers newer data with higher probabilities and older data with lower probabilities. We call such probability as survival probability. In this post, we discuss some math subtlety of the survival probability.

Posted by andrewconner  |   Mar 21 2013 / 09:34

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Recommended Links

Upvoters (4)



Downvoters (0)



    Scala
    Written by: Ryan Knight
    Featured Refcardz: Top Refcardz:
    1. Apache Hadoop
    2. Play
    3. Akka
    4. Debugging JavaScript
    5. Design Patterns
    1. Apache Hadoop
    2. REST
    3. Java
    4. Git
    5. Java Performance
    Connect with DZone