RIPQ
RIPQ – Interface
This animation shows the relative priority queue interface of RIPQ to implement a caching algorithm: insert(x,p) on cache miss, increase(x,p’) on cache hit, and delete-min() is called implicitly for cache eviction. The animation also demonstrates how these interfaces can be used to implement an advanced algorithm such as Segmented LRU.
All The Latest

October 14, 2020
Innovation comes through exploration and challenging our assumptions

August 31, 2020
Are Labels Necessary for Neural Architecture Search?

August 24, 2020