Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Md. Mostofa Ali Patwary"'
Publikováno v:
EMNLP (1)
Question and answer generation is a data augmentation method that aims to improve question answering (QA) models given the limited amount of human labeled data. However, a considerable gap remains between synthetic and human-generated question-answer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36d47459a9e615021d78982d24fabf7f
https://doi.org/10.18653/v1/2020.emnlp-main.468
https://doi.org/10.18653/v1/2020.emnlp-main.468
Autor:
Sergey Maidanov, Prabhat, Md. Mostofa Ali Patwary, Nalini Kumar, Adam Rupe, Frank Schlimbach, James P. Crutchfield, Vladislav Epifanov, Oleksandr Pavlyk, Victor W. Lee, Karthik Kashinath
Publikováno v:
MLHPC@SC
Extracting actionable insight from complex unlabeled scientific data is an open challenge and key to unlocking data-driven discovery in science. Complementary and alternative to supervised machine learning approaches, unsupervised physics-based metho
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e7e0fd9a4619efd843d8c592a7bf39c7
http://arxiv.org/abs/1909.11822
http://arxiv.org/abs/1909.11822
Autor:
Fredrik Manne, Arif O. Khan, Mahantesh Halappanavar, Pradeep Dubey, Md. Mostofa Ali Patwary, Narayanan Sundaram, Nadathur Satish, Alex Pothen
Publikováno v:
SIAM Journal on Scientific Computing. 38:S593-S619
We describe a half-approximation algorithm, $b$-Suitor, for computing a $b$-Matching of maximum weight in a graph with weights on the edges. $b$-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::81ffd668bad15a3b82836811b4153878
https://doi.org/10.1137/15m1026304
https://doi.org/10.1137/15m1026304
Autor:
Jiaji Huang, Kenneth Church, Md. Mostofa Ali Patwary, Milind Chabbi, Gregory Diamos, Heewoo Jun
Publikováno v:
IPDPS
We show how Zipf's Law can be used to scale up language modeling (LM) to take advantage of more training data and more GPUs. LM plays a key role in many important natural language applications such as speech recognition and machine translation. Scali
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2358b96a50c59c501cef4feae411f206
http://arxiv.org/abs/1810.10045
http://arxiv.org/abs/1810.10045
Autor:
Mikhail E. Smorkalov, Md. Mostofa Ali Patwary, Evan Racah, Srinivas Sridharan, Prabhat, Wahid Bhimji, Thorsten Kurth, Nadathur Satish, Jian Zhang, Mikhail Shiryaev, Tareq M. Malas, Pradeep Dubey, Narayanan Sundaram, Jack Deslippe, Ioannis Mitliagkas
Publikováno v:
SC
This paper presents the first, 15-PetaFLOP Deep Learning system for solving scientific pattern classification problems on contemporary HPC architectures. We develop supervised convolutional architectures for discriminating signals in high-energy phys
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3bf2d8cbbe6124c4a13adabe44da076a
http://arxiv.org/abs/1708.05256
http://arxiv.org/abs/1708.05256
Publikováno v:
ACM Transactions on Mathematical Software. 40:1-31
We present a suite of fast and effective algorithms, encapsulated in a software package called ColPack, for a variety of graph coloring and related problems. Many of the coloring problems model partitioning needs arising in compression-based computat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::779a591d0f592145cddfe77acfbb7e18
https://doi.org/10.1145/2513109.2513110
https://doi.org/10.1145/2513109.2513110
Autor:
Arif Khan, Alex Pothen, Md Mostofa Ali Patwary, Mahantesh Halappanavar, Nadathur Rajagopalan Satish, Narayanan Sundaram, Pradeep Dubey
Publikováno v:
SC16: International Conference for High Performance Computing, Networking, Storage and Analysis.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f519843381688a2b014887cbbcb1673
https://doi.org/10.1109/sc.2016.65
https://doi.org/10.1109/sc.2016.65
Autor:
Md. Mostofa Ali Patwary, Michael J. Anderson, Pradeep Dubey, Nadathur Satish, Narayanan Sundaram, Theodore L. Willke
Publikováno v:
IPDPS
The duality between graphs and matrices means that many common graph analyses can be expressed with primitives such as generalized sparse matrix-vector multiplication (SpMSpV) and sparse matrix-matrix multiplication (SpGEMM). Achieving high performan
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17341a4eb688276fb22e4e1daa653199
https://doi.org/10.1109/ipdps.2016.86
https://doi.org/10.1109/ipdps.2016.86
Publikováno v:
IPDPS Workshops
Connected Component Labeling (CCL) is an important step in pattern recognition and image processing. It assigns labels to the pixels such that adjacent pixels sharing the same features are assigned the same label. Typically, CCL requires several pass
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::27aa50fe9a0a194cacd6951cf51bbc74
Autor:
Md. Mostofa Ali Patwary, Alok Choudhary, Sanchit Misra, Ankit Agrawal, Wei-keng Liao, Yuhong Zhang, Zhiguang Qin
Publikováno v:
International Journal of Digital Content Technology and its Applications. 6:200-208
Pairwise statistical significance (PSS) has been recognized as a very useful method for homology detection. It can help in estimating whether the output of sequence alignment is evolutionarily link or just arisen by accident. However, pairwise statis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59baaaa9538784772b953678ca953f5c
https://doi.org/10.4156/jdcta.vol6.issue5.24
https://doi.org/10.4156/jdcta.vol6.issue5.24