default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDS. R. Balasundaram 0001
Person information
- affiliation: National Institute of Technology Trichy, Department of Computer Applications, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Shanmugasundaram Vengadeswaran
, S. R. Balasundaram, P. Dhavakumar:
IDaPS - Improved data-locality aware data placement strategy based on Markov clustering to enhance MapReduce performance on Hadoop. J. King Saud Univ. Comput. Inf. Sci. 36(3): 101973 (2024)- [j28]T. P. Raseena, Jitendra Kumar, S. R. Balasundaram:
DeepCPD: deep learning with vision transformer for colorectal polyp detection. Multim. Tools Appl. 83(32): 78183-78206 (2024) - [j27]K. Sakkaravarthy Iyyappan, S. R. Balasundaram:
An integer linear programming model for multi document summarization of learning materials using phrase embedding technique. Int. J. Syst. Assur. Eng. Manag. 15(6): 2772-2785 (2024) - [j26]T. P. Raseena, Jitendra Kumar, S. R. Balasundaram:
Exploring the Effectiveness of Deep Learning Architectures for Colorectal Polyp Detection: Performance Analysis and Insights. SN Comput. Sci. 5(5): 452 (2024) - [j25]Tharaniya Sairaj R, S. R. Balasundaram:
Fine-Tuned T5 Transformer with LSTM and Spider Monkey Optimizer for Redundancy Reduction in Automatic Question Generation. SN Comput. Sci. 5(5): 475 (2024) - [c21]Tharaniya Sairaj R, S. R. Balasundaram:
Exploring SPARQL query types to improve ontology mapping and retrieval augmented modelling for auto-generated questions (short paper). JOWO 2024 - 2023
- [j24]P. Krishnaveni, S. R. Balasundaram:
Generating fuzzy graph based Multi-document summary of text based learning materials. Expert Syst. Appl. 214: 119165 (2023) - [j23]K. Suresh, Rajarshi Pal, S. R. Balasundaram:
A stable cryptographic key generation from fingerprint biometrics using Gray code for secure data storage. Int. J. Inf. Comput. Secur. 20(3/4): 366-398 (2023) - [c20]T. P. Raseena, Jitendra Kumar, S. R. Balasundaram:
A Residual Learning Approach Towards the Diagnosis of Colorectal Disease Effectively. RTIP2R (2) 2023: 160-172 - 2022
- [j22]P. Krishnaveni, S. R. Balasundaram:
Automatic Text Summarization by Providing Coverage, Non-Redundancy, and Novelty Using Sentence Graph. J. Inf. Technol. Res. 15(1): 1-18 (2022) - 2021
- [j21]P. Krishnaveni, S. R. Balasundaram:
Summarizing Learning Materials Using Graph Based Multi-Document Summarization. Int. J. Web Based Learn. Teach. Technol. 16(5): 39-57 (2021) - [j20]S. Sajithabanu, S. R. Balasundaram:
Cost Optimization for Dynamic Content Delivery in Cloud-Based Content Delivery Network. J. Inf. Technol. Res. 14(4): 18-32 (2021) - [c19]Tharaniya Sairaj R, S. R. Balasundaram:
An Entailment Analysis Based Entity Mapping To Improve Automatic Question Generation. COMAD/CODS 2021: 424 - 2020
- [c18]Shanmugasundaram Vengadeswaran, Sadhu Ramakrishnan Balasundaram:
CLUST: Grouping Aware Data Placement for Improving the Performance of Large-Scale Data Management System. COMAD/CODS 2020: 1-9
2010 – 2019
- 2019
- [j19]A. Santhana Vijayan, S. R. Balasundaram:
Multi swarm optimization based automatic ontology for e-assessment. Comput. Networks 160: 192-199 (2019) - [j18]Shanmugasundaram Vengadeswaran, S. R. Balasundaram:
CORE?? an optimal data placement strategy in Hadoop for data intentitive applications based on cohesion relation. Comput. Syst. Sci. Eng. 34(1) (2019) - [j17]A. Santhana Vijayan, S. R. Balasundaram:
Fuzzy-MCS algorithm-based ontology generation for e-assessment. Int. J. Bus. Intell. Data Min. 14(4): 458-472 (2019) - [j16]S. Sajithabanu, S. R. Balasundaram:
Direct push-pull or assisted push-pull? Toward optimal video content delivery using shared storage-based cloud CDN (SS-CCDN). J. Supercomput. 75(4): 2193-2220 (2019) - 2018
- [j15]Selvam Sheba, Ramadoss Balakrishnan, S. R. Balasundaram:
Social event detection - a systematic approach using ontology and linked open data with significance to semantic links. Int. Arab J. Inf. Technol. 15(4): 729-738 (2018) - [j14]Shanmugasundaram Vengadeswaran, S. R. Balasundaram:
An Optimal Data Placement Strategy for Improving System Performance of Massive Data Applications Using Graph Clustering. Int. J. Ambient Comput. Intell. 9(3): 15-30 (2018) - [j13]S. Sajithabanu, S. R. Balasundaram:
Cost Effective Approaches for Content Placement in Cloud CDN Using Dynamic Content Delivery Model. Int. J. Cloud Appl. Comput. 8(3): 78-117 (2018) - [j12]Selvam Sheba, Ramadoss Balakrishnan, Sadhu Ramakrishnan Balasundaram:
Ontology With Hybrid Clustering Approach for Improving the Retrieval Relevancy in Social Event Detection. Int. J. Semantic Web Inf. Syst. 14(4): 33-56 (2018) - [j11]Shanmugasundaram Vengadeswaran, Sadhu Ramakrishnan Balasundaram:
Significance of Hierarchical and Markov Clustering in Grouping Aware Data Placement for Data Intensive Applications Having Interest Locality. Scalable Comput. Pract. Exp. 19(3): 245-258 (2018) - [j10]P. Shanthi Saravanan, S. R. Balasundaram:
Protecting Privacy in Location-Based Services Through Location Anonymization Using Cloaking Algorithms Based on Connected Components. Wirel. Pers. Commun. 102(1): 449-471 (2018) - 2016
- [j9]Kumaresh Nandhini, S. R. Balasundaram:
Improving Readability through Individualized Summary Extraction, Using Interactive Genetic Algorithm. Appl. Artif. Intell. 30(7): 635-661 (2016) - [j8]Shanthi Saravanan, Sadhu Ramakrishnan Balasundaram:
Preserving privacy in the context of location based services through location hider in mobile-tourism. J. Inf. Technol. Tour. 16(2): 229-248 (2016) - [c17]S. Sajithabanu, S. R. Balasundaram:
Cloud based Content Delivery Network using Genetic Optimization Algorithm for storage cost. ANTS 2016: 1-6 - 2015
- [j7]Selvam Sheba, Balakrishnan Ramadoss, S. R. Balasundaram:
Geo distance-based event detection in social media. Int. J. Comput. Intell. Stud. 4(1): 87-101 (2015) - [j6]P. Shanthi, S. R. Balasundaram:
A graph-based cloak algorithm to preserve location privacy in location-based services. Int. J. Inf. Priv. Secur. Integr. 2(2): 138-158 (2015) - 2014
- [j5]Kumaresh Nandhini, S. R. Balasundaram:
Extracting easy to understand summary using differential evolution algorithm. Swarm Evol. Comput. 16: 19-27 (2014) - 2013
- [j4]Kumaresh Nandhini, S. R. Balasundaram:
Use of Genetic Algorithm for Cohesive Summary Extraction to Assist Reading Difficulties. Appl. Comput. Intell. Soft Comput. 2013: 945623:1-945623:11 (2013) - [j3]P. Prema, Balakrishnan Ramadoss, S. R. Balasundaram:
An algorithm for merging two classification trees for test case generation. Comput. Syst. Sci. Eng. 28(4) (2013) - [j2]A. Saravanan, S. R. Balasundaram:
Integrated location aware medical care services. Electron. Mark. 23(1): 5-14 (2013) - [j1]P. Prema, Balakrishnan Ramadoss, S. R. Balasundaram:
Identification and deletion of duplicate subtrees in classification tree for test case reduction. Int. J. Inf. Syst. Chang. Manag. 6(4): 374-388 (2013) - [c16]P. Prema, Balakrishnan Ramadoss, S. R. Balasundaram:
An approach for reduced test path set selection. ICACCI 2013: 191-196 - [c15]Kumaresh Nandhini, S. R. Balasundaram:
Extracting and evaluating assistive summary for reading difficulties. ICACCI 2013: 1082-1087 - [c14]Selvam Sheba, Balakrishnan Ramadoss, S. R. Balasundaram:
Event Detection Refinement Using External Tags for Flickr Collections. ICACNI 2013: 369-375 - [c13]S. Akhilan, S. R. Balasundaram:
Personalizing News Documents Using Modified Page Rank Algorithms. ICACNI 2013: 1055-1061 - [c12]A. Santhana Vijayan, S. R. Balasundaram:
Effective Web-Service Discovery Using K-Means Clustering. ICDCIT 2013: 455-464 - 2012
- [c11]Kumaresh Nandhini, S. R. Balasundaram:
Significance of learner dependent features for improving text readability using extractive summarization. IHCI 2012: 1-5 - 2011
- [c10]Rajkumar Kannan, Mária Bieliková, Frédéric Andrès, S. R. Balasundaram:
Understanding honest feedbacks and opinions in academic environments. Bangalore Compute Conf. 2011: 21 - [c9]S. R. Balasundaram:
Securing tests in E-learning environment. ICCCS 2011: 624-627 - [c8]Kumaresh Nandhini, S. R. Balasundaram:
Math word question generation for training the students with learning difficulties. ICWET 2011: 206-211 - [c7]S. Akhilan, S. R. Balasundaram:
News personalization using enhanced term: document frequency (ETF-IDF) classification method. ICWET 2011: 212-217 - [c6]Balakrishnan Ramadoss, P. Prema, S. R. Balasundaram:
Improving test coverage using merged classification tree. ICWET 2011: 752-757 - [c5]Kumaresh Nandhini, S. R. Balasundaram:
Improving Readability of Dyslexic Learners through Document Summarization. T4E 2011: 246-249 - 2010
- [c4]Kumaresh Nandhini, Sadhu Ramakrishnan Balasundaram:
Graph Based Single Document Summarization. ICDEM 2010: 32-35 - [c3]Rajkumar Kannan, S. R. Balasundaram, Frédéric Andrès:
The role of mulsemedia in digital content ecosystem design. MEDES 2010: 264-266 - [c2]S. R. Balasundaram:
Accessing educational videos - A personalized approach. T4E 2010: 246-247
2000 – 2009
- 2004
- [c1]Balakrishnan Ramadoss, S. R. Balasundaram:
Aspects of Pervasive Computing for Web Based Learning. CIT 2004: 419-425
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:28 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:
