default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. M. Azharul Hasan
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Bohnishikha Halder, K. M. Azharul Hasan, Toshiyuki Amagasa, Md. Manjur Ahmed
:
Autonomic active learning strategy using cluster-based ensemble classifier for concept drifts in imbalanced data stream. Expert Syst. Appl. 231: 120578 (2023)- [c13]Faruk Hossen, K. M. Azharul Hasan, H. M. Abdul Fattah, Tatsuo Tsuji:
Partial Dominance: A New Framework for Top-k Dominating Queries on Highly Incomplete Data. ICCCNT 2023: 1-6 - 2022
- [j11]H. M. Abdul Fattah, K. M. Azharul Hasan, Tatsuo Tsuji:
Weighted top-k dominating queries on highly incomplete data. Inf. Syst. 107: 102008 (2022) - [j10]Soarov Chakraborty, Shourav Paul, K. M. Azharul Hasan:
A Transfer Learning-Based Approach with Deep CNN for COVID-19- and Pneumonia-Affected Chest X-ray Image Classification. SN Comput. Sci. 3(1): 17 (2022) - [j9]Md. Ashiq Mahmood, K. M. Azharul Hasan:
An Efficient Compression Scheme for Natural Language Text by Hashing. SN Comput. Sci. 3(4): 314 (2022) - [c12]K. M. Azharul Hasan, Md. Safayet Hossain:
Sparse tensor storage by tensor unfolding. SAC 2022: 423-428 - 2021
- [j8]Mohammad Marufur Rahman, Sheikh Nooruddin, K. M. Azharul Hasan, Nahin Kumar Dey:
HOG + CNN Net: Diagnosing COVID-19 and Pneumonia by Deep Neural Network from Chest X-Ray Images. SN Comput. Sci. 2(5): 371 (2021) - [j7]Mehnuma Tabassum Omar, K. M. Azharul Hasan, Tatsuo Tsuji:
A scalable array storage for efficient maintenance of future data. J. Supercomput. 77(7): 6540-6565 (2021) - [c11]Soarov Chakraborty, K. M. Azharul Hasan, Shourav Paul:
A Reinforcement Learning Framework for Lung Segmentation of COVID-19 and Pneumonia Affected Chest X-Ray Image. PReMI 2021: 224-232
2010 – 2019
- 2017
- [j6]K. M. Azharul Hasan, Md Abu Hanif Shaikh:
Efficient representation of higher-dimensional arrays by dimension transformations. J. Supercomput. 73(6): 2801-2822 (2017) - [c10]Mehnuma Tabassum Omar, K. M. Azharul Hasan:
An Efficient Encoding Scheme for Dynamic Multidimensional Datasets. PReMI 2017: 517-523 - [c9]Mir Shahriar Sabuj, Zakia Afrin, K. M. Azharul Hasan:
Opinion Mining Using Support Vector Machine with Web Based Diverse Data. PReMI 2017: 673-678 - 2016
- [c8]Mehnuma Tabassum Omar, K. M. Azharul Hasan:
A scalable storage system for structured data based on higher order index array. BDCAT 2016: 247-252 - [c7]Md Abu Hanif Shaikh, K. M. Azharul Hasan, G. G. Md. Nawaz Ali, Marwa Chafii, Peter Han Joo Chong:
Efficient Matricization of n-D Array with CUDA and Its Evaluation. CSE/EUC/DCABES 2016: 246-252 - [c6]Mehnuma Tabassum Omar, K. M. Azharul Hasan:
Towards an Efficient Maintenance of Address Space Overflow for Array Based Storage System. PDCAT 2016: 133-138 - 2015
- [j5]Sk. Md. Masudul Ahsan, K. M. Azharul Hasan:
Segment Oriented Compression Scheme for MOLAP Based on Extendible Multidimensional Arrays. J. Comput. Inf. Technol. 23(2): 111-121 (2015) - [c5]Md Abu Hanif Shaikh, K. M. Azharul Hasan:
Efficient storage scheme for n-dimensional sparse array: GCRS/GCCS. HPCS 2015: 137-142 - 2013
- [j4]Sk. Md. Masudul Ahsan, K. M. Azharul Hasan:
Extendible Multidimensional Array Based Storage Scheme for Efficient Management of High Dimensional Data. Int. J. Next Gener. Comput. 4(1) (2013) - [j3]Sk. Md. Masudul Ahsan, K. M. Azharul Hasan:
An Efficient Encoding Scheme to Handle the Address Space Overflow for Large Multidimensional Arrays. J. Comput. 8(5): 1136-1144 (2013) - 2012
- [i3]K. M. Azharul Hasan, Al-Mahmud, Amit Mondal, Amit Saha:
Recognizing Bangla Grammar using Predictive Parser. CoRR abs/1201.2010 (2012) - 2011
- [c4]Rakibul Islam, K. M. Azharul Hasan, Tatsuo Tsuji:
EaCRS: an extendible array based compression scheme for high dimensional data. SoICT 2011: 92-99 - 2010
- [i2]K. M. Azharul Hasan, Mohammad Sabbir Hasan:
A Parsing Scheme for Finding the Design Pattern and Reducing the Development Cost of Reusable Object Oriented Software. CoRR abs/1006.1182 (2010) - [i1]K. M. Azharul Hasan, Mohammad Sabbir Hasan:
A Parsing Scheme for Finding the Design Pattern and Reducing the Development Cost of Reusable Object Oriented Software. CoRR abs/1008.1671 (2010)
2000 – 2009
- 2009
- [j2]Ifta Khirul, K. M. Azharul Hasan, Md. Kamrul Islam:
TUKAB: An Efficient NAT Traversal Scheme on Security of VoIP Network System Based on Session Initiation Protocol. J. Comput. Inf. Technol. 17(2): 185-194 (2009) - 2007
- [c3]K. M. Azharul Hasan, Tatsuo Tsuji, Ken Higuchi:
An Efficient Implementation for MOLAP Basic Data Structure and Its Evaluation. DASFAA 2007: 288-299 - 2006
- [j1]K. M. Azharul Hasan, Tatsuo Tsuji, Ken Higuchi:
A Parallel Implementation Scheme of Relational Tables Based on Multidimensional Extendible Array. Int. J. Data Warehous. Min. 2(4): 66-85 (2006) - 2005
- [c2]K. M. Azharul Hasan, Masayuki Kuroda, Naoki Azuma, Tatsuo Tsuji, Ken Higuchi:
An Extendible Array Based Implementation of Relational Tables for Multi Dimensional Databases. DaWaK 2005: 233-242 - [c1]Masayuki Kuroda, Naoki Amma, K. M. Azharul Hasan, Tatsuo Tsuji, Ken Higuchi:
An Implementation Scheme of Relational Tables. ICDE Workshops 2005: 1244
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 2025-03-04 22:25 CET 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:
