Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Raghavendra Addanki"'
Autor:
Akash Maharaj, Ritwik Sinha, David Arbour, Ian Waudby-Smith, Simon Z. Liu, Moumita Sinha, Raghavendra Addanki, Aaditya Ramdas, Manas Garg, Viswanathan Swaminathan
A/B tests are the gold standard for evaluating digital experiences on the web. However, traditional "fixed-horizon" statistical methods are often incompatible with the needs of modern industry practitioners as they do not permit continuous monitoring
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14e11b455a6dfa17d4b1240212604418
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Metric based comparison operations such as finding maximum, nearest and farthest neighbor are fundamental to studying various clustering techniques such as $k$-center clustering and agglomerative hierarchical clustering. These techniques crucially re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad0a1cec9f919228b45fe7061e68babf
http://arxiv.org/abs/2105.05782
http://arxiv.org/abs/2105.05782
Autor:
Ali Montazeralghaem, James Allan, Soumyabrata Pal, Sheikh Muhammad Sarwar, Raghavendra Addanki
Publikováno v:
ICTIR
Search result diversification based on topic proportionality considers a document as a bag of weighted topics and aims to reorder or down-sample a ranked list in a way that maintains topic proportionality. The goal is to show the topic distribution f
Publikováno v:
STOC
We give new upper and lower bounds for the dynamic set cover problem. First, we give a (1+є) f-approximation for fully dynamic set cover in O(f2logn/є5) (amortized) update time, for any є > 0, where f is the maximum number of sets that an element