Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Sagnik Nandy"'
Autor:
Zongming Ma, Sagnik Nandy
Publikováno v:
IEEE Transactions on Information Theory. 69:3203-3239
In this paper, we study community detection when we observe $m$ sparse networks and a high dimensional covariate matrix, all encoding the same community structure among $n$ subjects. In the asymptotic regime where the number of features $p$ and the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cb21eb2834f2e8095d93b22a534de660
https://doi.org/10.1109/tit.2023.3238352
https://doi.org/10.1109/tit.2023.3238352
Publikováno v:
The International Journal of High Performance Computing Applications. 20:45-59
Overlapping communication with computation is a wellknown technique to increase application performance. While it is commonly assumed that communication and computation can be overlapped at no cost, in reality they interfere with each other. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3b52396e8113e759ce83889c26f9ad4
https://doi.org/10.1177/1094342006061889
https://doi.org/10.1177/1094342006061889
Publikováno v:
IPDPS
A growing trend in the development and deployment of grid computing systems is decentralization. Decentralizing these systems helps make the more scalable and robust, but poses several challenges. In this paper we address one such problem - that of l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a17662dbb9f8bc0d93dc97fddd22e35
https://doi.org/10.1109/ipdps.2005.238
https://doi.org/10.1109/ipdps.2005.238
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540241294
HiPC
HiPC
This paper investigates the problem of autonomously allocating a large number of independent, equal sized tasks on a distributed heterogeneous grid-like platform, using only local information We propose A-FAST (Autonomous Flow Approach to Scheduling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b02b96c1c47ecbee39ddb1ed76557c0b
https://doi.org/10.1007/978-3-540-30474-6_40
https://doi.org/10.1007/978-3-540-30474-6_40
Publikováno v:
Languages and Compilers for Parallel Computing ISBN: 9783540211990
LCPC
LCPC
Program profiling can help performance prediction and compiler optimization. This paper describes the initial work behind TFP, a new profiling strategy that can gather and verify a range of flow-specific information at runtime. While TFP can collect
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f7bf84d04df4e0c329b72d5128a3b1b
https://doi.org/10.1007/978-3-540-24644-2_3
https://doi.org/10.1007/978-3-540-24644-2_3