default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDK. Balasubramanian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j11]Prasanth Thiruvenkatam
, Prabu Thangavel, K. Balasubramanian, Sridhar Sekar:
Video Surveillance System-Based Human Activity Recognition Using Hierarchical Auto-Associative Polynomial Convolutional Neural Network with Garra Rufa Fish Optimization. Int. J. Pattern Recognit. Artif. Intell. 38(11): 2456007:1-2456007:30 (2024)- 2022
- [j10]P. Manivannan, D. Prabha, K. Balasubramanian:
Artificial intelligence databases: turn-on big data of the SMBs. Int. J. Bus. Inf. Syst. 39(1): 1-16 (2022) - 2018
- [j9]K. Balasubramanian, V. Selladurai:
Achieving operational excellence in ERP manufacturer industries: through operation transformations. Int. J. Bus. Inf. Syst. 29(3): 403-420 (2018) - 2016
- [j8]S. Raja Balachandar, K. Kannan, R. Srikanth, Selvaraj Balachandran, S. G. Venkatesh, K. Balasubramanian:
Gravitational search algorithm based solution for a class of ternary diophantine equations. J. Comput. Methods Sci. Eng. 16(4): 899-911 (2016) - 2014
- [j7]P. Shanmugavadivu, K. Balasubramanian:
Thresholded and Optimized Histogram Equalization for contrast enhancement of images. Comput. Electr. Eng. 40(3): 757-768 (2014) - [j6]P. Shanmugavadivu, K. Balasubramanian, A. Muruganandam:
Particle swarm optimized bi-histogram equalization for contrast enhancement and brightness preservation of images. Vis. Comput. 30(4): 387-399 (2014) - 2003
- [j5]K. Balasubramanian, V. Parameswaran, Siddani Bhaskara Rao:
Characterization of Cycle Stochastic Graphs. Electron. Notes Discret. Math. 15: 36 (2003) - 1995
- [j4]K. Balasubramanian:
A flash ADC with reduced complexity. IEEE Trans. Ind. Electron. 42(1): 106-108 (1995) - 1994
- [j3]Dan Gusfield, K. Balasubramanian, Dalit Naor:
Parametric Optimization of Sequence Alignment. Algorithmica 12(4/5): 312-326 (1994) - 1992
- [j2]K. Balasubramanian:
Combinatorics of cluster enumeration. J. Chem. Inf. Comput. Sci. 32(1): 47-54 (1992) - 1982
- [j1]K. Balasubramanian:
Computer generation of isomers. Comput. Chem. 6(2): 57-63 (1982)
Conference and Workshop Papers
- 2008
- [c4]Veluchandhar Vadivelu, R. V. Jayakumar, M. Muthuvel, K. Balasubramanian, A. Karthi, Karthikesan, G. Ramaiyan, Alagarsamy Deepa, S. Albert Rabara:
A backup mechanism with concurrency control for multilevel secure distributed database systems. ICDIM 2008: 57-62 - 2006
- [c3]K. Balasubramanian:
Sonar buoys: An improved design approach. ICINCO-SPSMC 2006: 161-167 - [c2]K. Balasubramanian:
A High Performance Flash ADC with Programmable Word-Length. PDPTA 2006: 1021-1027 - 1992
- [c1]Dan Gusfield, K. Balasubramanian, Dalit Naor:
Parametric Optimization of Sequence Alignment. SODA 1992: 432-439
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-22 00:35 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:
