PDF Archive search engine
Last database update: 18 April at 03:42 - Around 76000 files indexed.
One “fast” algorithm by Sermadevi et al had a runtime of O(Q*N*M), where Q is the number of quantizers to search, N is the number of frames, and M is the number of frames affected by a change in allocation to any given frame. Even as improved in Toivonen et al, this class of algorithms still typically took dozens or hundreds of encode calls per frame, putting it out of the reach of most practical encoders.
Michael Dyer Student ID: #500714787 RTA101 / Section (111):
CS 224N Final Project: