default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbhisek Kundu
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]Evangelos Georganas, Dhiraj D. Kalamkar, Kirill Voronin, Abhisek Kundu, Antonio Noack, Hans Pabst, Alexander Breuer, Alexander Heinecke:
Harnessing Deep Learning and HPC Kernels via High-Level Loop and Tensor Abstractions on CPU Architectures. IPDPS 2024: 950-963- 2023
- [i12]Abhisek Kundu, Naveen K. Mellempudi, Dharma Teja Vooturi, Bharat Kaul, Pradeep Dubey:
AUTOSPARSE: Towards Automated Sparse Training of Deep Neural Networks. CoRR abs/2304.06941 (2023) - 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) - 2021
- [c3]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 - [i11]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)
2010 – 2019
- 2019
- [i10]Dhiraj D. Kalamkar, Dheevatsa Mudigere, Naveen Mellempudi, Dipankar Das, Kunal Banerjee, Sasikanth Avancha, Dharma Teja Vooturi, Nataraj Jammalamadaka, Jianyu Huang, Hector Yuen, Jiyan Yang, Jongsoo Park, Alexander Heinecke, Evangelos Georganas, Sudarshan Srinivasan, Abhisek Kundu, Misha Smelyanskiy, Bharat Kaul, Pradeep Dubey:
A Study of BFLOAT16 for Deep Learning Training. CoRR abs/1905.12322 (2019) - [i9]Abhisek Kundu, Sudarshan Srinivasan, Eric C. Qin, Dhiraj D. Kalamkar, Naveen K. Mellempudi, Dipankar Das, Kunal Banerjee, Bharat Kaul, Pradeep Dubey:
K-TanH: Hardware Efficient Activations For Deep Learning. CoRR abs/1909.07729 (2019) - 2017
- [j4]Abhisek Kundu:
Relaxed leverage sampling for low-rank matrix completion. Inf. Process. Lett. 124: 6-9 (2017) - [j3]Abhisek Kundu, Petros Drineas
, Malik Magdon-Ismail:
Recovering PCA and Sparse PCA via Hybrid-(l1, l2) Sparse Sampling of Data Elements. J. Mach. Learn. Res. 18: 75:1-75:34 (2017) - [j2]Kimon Fountoulakis, Abhisek Kundu, Eugenia-Maria Kontopoulou, Petros Drineas:
A Randomized Rounding Algorithm for Sparse PCA. ACM Trans. Knowl. Discov. Data 11(3): 38:1-38:26 (2017) - [i8]Naveen Mellempudi, Abhisek Kundu, Dipankar Das, Dheevatsa Mudigere, Bharat Kaul:
Mixed Low-precision Deep Learning Inference using Dynamic Fixed Point. CoRR abs/1701.08978 (2017) - [i7]Naveen Mellempudi, Abhisek Kundu, Dheevatsa Mudigere, Dipankar Das, Bharat Kaul, Pradeep Dubey:
Ternary Neural Networks with Fine-Grained Quantization. CoRR abs/1705.01462 (2017) - [i6]Abhisek Kundu, Kunal Banerjee, Naveen Mellempudi, Dheevatsa Mudigere, Dipankar Das, Bharat Kaul, Pradeep Dubey:
Ternary Residual Networks. CoRR abs/1707.04679 (2017) - 2015
- [b1]Abhisek Kundu:
Element-wise matrix sparsification and reconstruction. Rensselaer Polytechnic Institute, USA, 2015 - [c2]Abhisek Kundu, Petros Drineas, Malik Magdon-Ismail:
Approximating Sparse PCA from Incomplete Data. NIPS 2015: 388-396 - [i5]Abhisek Kundu, Petros Drineas, Malik Magdon-Ismail:
Recovering PCA from Hybrid-(ℓ1, ℓ2) Sparse Sampling of Data Elements. CoRR abs/1503.00547 (2015) - [i4]Abhisek Kundu, Petros Drineas, Malik Magdon-Ismail:
Approximating Sparse PCA from Incomplete Data. CoRR abs/1503.03903 (2015) - [i3]Abhisek Kundu:
Relaxed Leverage Sampling for Low-rank Matrix Completion. CoRR abs/1503.06379 (2015) - [i2]Petros Drineas, Kimon Fountoulakis, Abhisek Kundu:
A Randomized Rounding Algorithm for Sparse PCA. CoRR abs/1508.03337 (2015) - 2014
- [i1]Abhisek Kundu, Petros Drineas:
A Note on Randomized Element-wise Matrix Sparsification. CoRR abs/1404.0320 (2014) - 2010
- [j1]Philip R. O. Payne, Kun Huang, Kristin Keen-Circle, Abhisek Kundu, Jie Zhang, Tara Borlawsky:
Multi-dimensional discovery of biomarker and phenotype complexes. BMC Bioinform. 11(S-9): S3 (2010)
2000 – 2009
- 2009
- [c1]Abhisek Kundu, Hatice Gulcin Ozer, Tara Borlawsky, Kristin C. Circle, Kun Huang, Philip R. O. Payne:
Clinical Attribute Network for Chronic Lymphocytic Leukemia. BIBM 2009: 279-282
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-09-13 00:39 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:
