| A Framework for Comparing Graph Embeddings F Théberge 2021 Joint Mathematics Meetings (JMM), 0 | | |
| A framework for dimensioning and connection acceptance control in ATM networks F Theberge, RR Mazumdar Proceedings of 35th IEEE Conference on Decision and Control 3, 2921-2926, 1996 | | 1996 |
| A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs B Kamiński, Ł Kraiński, P Prałat, F Théberge Network Science 10 (4), 323-346, 2022 | 7 | 2022 |
| A scalable unsupervised framework for comparing graph embeddings B Kamiński, P Prałat, F Théberge Algorithms and Models for the Web Graph: 17th International Workshop, WAW …, 2020 | 8 | 2020 |
| A simple upper bound for blocking probabilities in large multi-rate loss networks F Theberge, A Simonian, RR Mazumdar Proceedings 1995 Canadian Conference on Electrical and Computer Engineering …, 1995 | 1 | 1995 |
| Algorithms and Models for the Web Graph M Dewar, P Prałat, P Szufel, F Théberge, M Wrzosek | | |
| Algorithms and Models for the Web Graph: 18th International Workshop, WAW 2023, Toronto, ON, Canada, May 23–26, 2023, Proceedings M Dewar, P Prałat, P Szufel, F Théberge, M Wrzosek Springer Nature, 2023 | | 2023 |
| Almost all complete binary prefix codes have a self-synchronizing string CF Freiling, DS Jungreis, F Théberge, K Zeger IEEE Transactions on Information Theory 49 (9), 2219-2225, 2003 | 35 | 2003 |
| An efficient reduced load heuristic for computing call blocking in large multirate loss networks F Theberge, RR Mazumdar Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference 1 …, 1996 | 3 | 1996 |
| An unsupervised framework for comparing graph embeddings B Kamiński, P Prałat, F Théberge Journal of Complex Networks 8 (5), cnz043, 2020 | 24 | 2020 |
| Approximation formulae for blocking probabilities in a large Erlang loss system: a probabilistic approach F Theberge, RR Mazumdar Proceedings of INFOCOM'95 2, 804-809, 1995 | 11 | 1995 |
| Artificial Benchmark for Community Detection (ABCD) B Kaminski, T Olczak, F Théberge Joint Mathematics Meetings (JMM), AMS 225, 227, 2021 | 1 | 2021 |
| Artificial benchmark for community detection (abcd)—fast random graph model with community structure B Kamiński, P Prałat, F Théberge Network Science 9 (2), 153-178, 2021 | 45 | 2021 |
| Artificial benchmark for community detection with outliers (ABCD+ o) B Kamiński, P Prałat, F Théberge Applied Network Science 8 (1), 25, 2023 | 6 | 2023 |
| Asymptotic estimates for blocking probabilities in a large multi-rate loss network A Simonian, JW Roberts, F Theberge, R Mazumdar Advances in Applied Probability 29 (3), 806-829, 1997 | 25 | 1997 |
| Calculating cell loss probabilities for ON-OFF sources in large unbuffered systems N Likhanov, RR Mazumdar, F Theberge Proceedings of ICC'97-International Conference on Communications 2, 560-564, 1997 | 2 | 1997 |
| Cell loss probability for M/G/1 and time-slotted queues D McDonald, F Théberge Journal of applied probability 37 (4), 1149-1156, 2000 | 2 | 2000 |
| Classification supported by community-aware node features B Kamiński, P Prałat, F Théberge, S Zając International Conference on Complex Networks and Their Applications, 133-145, 2023 | 1 | 2023 |
| Clustering via hypergraph modularity B Kamiński, V Poulin, P Prałat, P Szufel, F Théberge PloS one 14 (11), e0224307, 2019 | 87 | 2019 |
| Clustering via Hypergraph Modularity P law Szufel, F Théberge | | 2019 |
Pawel PralatToronto Metropolitan University在 ryerson.ca 的电子邮件经过验证
