default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRamanarayan Mohanty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j5]Evangelos Georganas, Dhiraj D. Kalamkar, Sasikanth Avancha, Menachem Adelman, Deepti Aggarwal, Cristina Anderson, Alexander Breuer, Jeremy Bruestle, Narendra Chaudhary, Abhisek Kundu, Denise Kutnick, Frank Laub, Md. Vasimuddin, Sanchit Misra, Ramanarayan Mohanty, Hans Pabst, Brian Retford, Barukh Ziv, Alexander Heinecke:
Tensor Processing Primitives: A Programming Abstraction for Efficiency and Portability in Deep Learning and HPC Workloads. Frontiers Appl. Math. Stat. 8: 826269 (2022)- [i10]Md. Vasimuddin, Ramanarayan Mohanty, Sanchit Misra, Sasikanth Avancha:
DistGNN-MB: Distributed Large-Scale Graph Neural Network Training on x86 via Minibatch Sampling. CoRR abs/2211.06385 (2022) - 2021
- [c5]Evangelos Georganas, Dhiraj D. Kalamkar, Sasikanth Avancha, Menachem Adelman, Cristina Anderson, Alexander Breuer, Jeremy Bruestle, Narendra Chaudhary, Abhisek Kundu, Denise Kutnick, Frank Laub, Md. Vasimuddin, Sanchit Misra, Ramanarayan Mohanty, Hans Pabst, Barukh Ziv, Alexander Heinecke:
Tensor processing primitives: a programming abstraction for efficiency and portability in deep learning workloads. SC 2021: 14 - [c4]Md. Vasimuddin, Sanchit Misra, Guixiang Ma, Ramanarayan Mohanty, Evangelos Georganas, Alexander Heinecke, Dhiraj D. Kalamkar, Nesreen K. Ahmed
, Sasikanth Avancha:
DistGNN: scalable distributed training for large-scale graph neural networks. SC 2021: 76 - [i9]Evangelos Georganas, Dhiraj D. Kalamkar, Sasikanth Avancha, Menachem Adelman, Cristina Anderson, Alexander Breuer, Narendra Chaudhary, Abhisek Kundu, Md. Vasimuddin, Sanchit Misra, Ramanarayan Mohanty, Hans Pabst, Barukh Ziv, Alexander Heinecke:
Tensor Processing Primitives: A Programming Abstraction for Efficiency and Portability in Deep Learning Workloads. CoRR abs/2104.05755 (2021) - [i8]Md. Vasimuddin, Sanchit Misra, Guixiang Ma, Ramanarayan Mohanty, Evangelos Georganas, Alexander Heinecke, Dhiraj D. Kalamkar, Nesreen K. Ahmed, Sasikanth Avancha:
DistGNN: Scalable Distributed Training for Large-Scale Graph Neural Networks. CoRR abs/2104.06700 (2021) - 2020
- [i7]Sasikanth Avancha, Md. Vasimuddin, Sanchit Misra, Ramanarayan Mohanty:
Deep Graph Library Optimizations for Intel(R) x86 Architecture. CoRR abs/2007.06354 (2020)
2010 – 2019
- 2019
- [j4]Ramanarayan Mohanty, S. L. Happy, Aurobinda Routray:
Spatial-Spectral Regularized Local Scaling Cut for Dimensionality Reduction in Hyperspectral Image Classification. IEEE Geosci. Remote. Sens. Lett. 16(6): 932-936 (2019) - [j3]Ramanarayan Mohanty, S. L. Happy, Aurobinda Routray:
A Semisupervised Spatial Spectral Regularized Manifold Local Scaling Cut With HGF for Dimensionality Reduction of Hyperspectral Images. IEEE Trans. Geosci. Remote. Sens. 57(6): 3423-3435 (2019) - 2018
- [j2]Ramanarayan Mohanty, S. L. Happy, Aurobinda Routray:
A Supervised Geometry-Aware Mapping Approach for Classification of Hyperspectral Images. IEEE Geosci. Remote. Sens. Lett. 15(4): 582-586 (2018) - [c3]Ramanarayan Mohanty, S. L. Happy, Nilesh Suthar, Aurobinda Routray:
A Trace Lasso Regularized Ll-norm Graph Cut for Highly Correlated Noisy Hyperspectral Image. EUSIPCO 2018: 2220-2224 - [i6]Ramanarayan Mohanty, S. L. Happy, Aurobinda Routray:
A Supervised Geometry-Aware Mapping Approach for Classification of Hyperspectral Images. CoRR abs/1807.02682 (2018) - [i5]Ramanarayan Mohanty, S. L. Happy, Nilesh Suthar, Aurobinda Routray:
A Trace Lasso Regularized L1-norm Graph Cut for Highly Correlated Noisy Hyperspectral Image. CoRR abs/1807.10602 (2018) - [i4]Ramanarayan Mohanty, S. L. Happy, Aurobinda Routray:
A Semi-supervised Spatial Spectral Regularized Manifold Local Scaling Cut With HGF for Dimensionality Reduction of Hyperspectral Images. CoRR abs/1811.08223 (2018) - [i3]Ramanarayan Mohanty, S. L. Happy, Aurobinda Routray:
Spatial-Spectral Regularized Local Scaling Cut for Dimensionality Reduction in Hyperspectral Image Classification. CoRR abs/1812.08047 (2018) - 2017
- [c2]Ramanarayan Mohanty, S. L. Happy, Aurobinda Routray:
Graph scaling cut with L1-norm for classification of hyperspectral images. EUSIPCO 2017: 793-797 - [c1]S. L. Happy, Ramanarayan Mohanty, Aurobinda Routray:
An effective feature selection method based on pair-wise feature proximity for high dimensional low sample size data. EUSIPCO 2017: 1574-1578 - [i2]S. L. Happy, Ramanarayan Mohanty, Aurobinda Routray:
An Effective Feature Selection Method Based on Pair-Wise Feature Proximity for High Dimensional Low Sample Size Data. CoRR abs/1708.02443 (2017) - [i1]Ramanarayan Mohanty, S. L. Happy, Aurobinda Routray:
Graph Scaling Cut with L1-Norm for Classification of Hyperspectral Images. CoRR abs/1709.02920 (2017) - 2016
- [j1]Tapan Pradhan, Bibek Kabi, Ramanarayan Mohanty, Aurobinda Routray:
Development of numerical linear algebra algorithms in dynamic fixed-point format: a case study of Lanczos tridiagonalization. Int. J. Circuit Theory Appl. 44(6): 1222-1262 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
