( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes.

, , и . COLT, том 49 из JMLR Workshop and Conference Proceedings, стр. 103-115. JMLR.org, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Rein Anari

Manfred Nimax

Nima Mazloumi

Entwurf eines Referenzmodells und Frameworks zur Erstellung hybrider Lehr- und Lernszenarien: mit Fallbeispielen aus der Betriebswirtschaftslehre und der Wirtschaftsinformatik. Uni Mannheim, (2009)

Nima Barraci

Nima Torabkhani

 

Другие публикации лиц с тем же именем

Entropic independence: optimal mixing of down-up random walks., , , , и . STOC, стр. 1418-1430. ACM, (2022)Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP., и . FOCS, стр. 20-39. IEEE Computer Society, (2015)Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes., , и . COLT, том 49 из JMLR Workshop and Conference Proceedings, стр. 103-115. JMLR.org, (2016)Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model., , и . FOCS, стр. 1319-1330. IEEE, (2020)Learning Multimodal Rewards from Rankings., , , и . CoRL, том 164 из Proceedings of Machine Learning Research, стр. 342-352. PMLR, (2021)Parallel Sampling of Diffusion Models., , , , и . CoRR, (2023)Log-Concave Polynomials IV: Exchange Properties, Tight Mixing Times, and Faster Sampling of Spanning Trees., , , и . CoRR, (2020)Euclidean Movement Minimization., , , , и . CCCG, (2011)Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid., , , и . STOC, стр. 1-12. ACM, (2019)Parallel Sampling via Counting., , и . STOC, стр. 537-548. ACM, (2024)