( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Looking for Science in the Art of Network Measurement.

, и . IWDC, том 2170 из Lecture Notes in Computer Science, стр. 524-535. Springer, (2001)

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.

Matthias Meyer

Musterbasiertes Re-Engineering von Softwaresystemen. Uni Paderborn, (2009)

Matthias Hägele

Immunrekonstitution nach haploidenter hämatopoetischer Stammzelltransplantation: Einfluss eines CD3-CD19-depletierten gegenüber einem CD34-selektionierten Transplantat. Uni Tübingen, (2008)

Matthias Schmidt

Topographische Verteilung und Morphometrie von retinalen Mikrogliazellen. Uni Münster, (2009)

Matthias Möller

Antikaons in infinite nuclear matter and nuclei. TU Darmstadt, (2007)

Matthias Zimmer

Risikomanagment: Fehlermanagment in der präklinischen Notfallmedizin. Uni Frankfurt Main, (2009)
 

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

When can two unlabeled networks be aligned under partial overlap?, , и . Allerton, стр. 33-42. IEEE, (2015)On the privacy of anonymized networks., и . KDD, стр. 1235-1243. ACM, (2011)Age matters: efficient route discovery in mobile ad hoc networks using encounter ages., , и . MobiHoc, стр. 257-266. ACM, (2003)On the performance of percolation graph matching., и . COSN, стр. 119-130. ACM, (2013)Valuable detours: least-cost anypath routing., , и . IEEE/ACM Trans. Netw., 19 (2): 333-346 (2011)A Variational Inference Approach to Learning Multivariate Wold Processes., , , , и . AISTATS, том 130 из Proceedings of Machine Learning Research, стр. 2044-2052. PMLR, (2021)Scalable and Efficient Comparison-based Search without Features., , и . ICML, том 119 из Proceedings of Machine Learning Research, стр. 1995-2005. PMLR, (2020)A Time-Scale Decomposition Approach to Measurement-Based Admission Control., и . INFOCOM, стр. 1539-1547. IEEE Computer Society, (1999)A Bayesian method for matching two similar graphs without seeds., , и . Allerton, стр. 1598-1607. IEEE, (2013)It's All Relative: Learning Interpretable Models for Scoring Subjective Bias in Documents from Pairwise Comparisons., , и . EACL (1), стр. 1341-1353. Association for Computational Linguistics, (2024)