" I also needed to be able to query the k most frequently contacted contacts. / To solve this problem, I created an augmented binary tree which provides an insertion time of O(k log n), a search time of O( log n), and can find the top k contacts in O(1). "
Ryan Marcus, assistant professor at the University of Pennsylvania (Fall '23). Using machine learning to build the next generation of data systems. ____ __ ___ / __ \__ ______ _____ / |/ /___ _____...
" I also needed to be able to query the k most frequently contacted contacts. / To solve this problem, I created an augmented binary tree which provides an insertion time of O(k log n), a search time of O( log n), and can find the top k contacts in O(1). "
このブックマークにはスターがありません。
最初のスターをつけてみよう！
Ryan Marcus · UPenn
Ryan Marcus, assistant professor at the University of Pennsylvania (Fall '23). Using machine learning to build the next generation of data systems. ____ __ ___ / __ \__ ______ _____ / |/ /___ _____...
4 人がブックマーク・1 件のコメント
＼ コメントが サクサク読める アプリです ／