Author image not provided
 K G Subramanian

Authors:
Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article2.12
Citation Count121
Publication count57
Publication years1987-2017
Available for download3
Average downloads per article353.33
Downloads (cumulative)1,060
Downloads (12 Months)264
Downloads (6 Weeks)17
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


57 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 57
Result page: 1 2 3

Sort by:

1
January 2017 International Journal of Artificial Intelligence and Soft Computing: Volume 5 Issue 4, January 2017
Publisher: Inderscience Publishers
Bibliometrics:
Citation Count: 0

In the area of DNA computing, a biologically motivated operation called splicing on linear words as well as circular words was introduced by Head 1987, 1992. Motivated by this operation, the concept of flat splicing on words was introduced by Berstel et al. 2012. This operation was extended by Subramanian ...
Keywords: grammar systems, DNA computing, picture language, context-free grammars, flat splicing, floor design, kolam pattern, picture arrays

2 published by ACM
February 2016 ACM Transactions on Intelligent Systems and Technology (TIST) - Regular Papers, Survey Papers and Special Issue on Recommender System Benchmarks: Volume 7 Issue 3, April 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 13,   Downloads (12 Months): 168,   Downloads (Overall): 432

Full text available: PDFPDF
Crowd and evacuation management have been active areas of research and study in the recent past. Various developments continue to take place in the process of efficient evacuation of crowds in mass gatherings. This article is intended to provide a review of intelligent evacuation management systems covering the aspects of ...
Keywords: Crowd monitoring, evacuation modelling, crowd management, evacuation path guidelines, prediction of crowd disaster

3
November 2015 IWCIA 2015: Proceedings of the 17th International Workshop on Combinatorial Image Analysis - Volume 9448
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Pure two-dimensional context-free grammar P2DCFG is a simple but effective non-isometric 2D grammar model to generate picture arrays. This 2D grammar uses only one kind of symbol as in a pure string grammar and rewrites in parallel all the symbols in a column or row by a set of context-free ...

4
October 2015 Annals of Mathematics and Artificial Intelligence: Volume 75 Issue 1-2, October 2015
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

Contextual array grammars, with selectors not having empty cells, are considered. A P system model, called contextual array P system, that makes use of array objects and contextual array rules, is introduced and its generative power for the description of picture arrays is examined. A main result of the paper ...
Keywords: 68Q05, Array grammars, Contextual array rules, 68Q42, 68Q45, Two-dimensional arrays, ArrayP systems

5 published by ACM
August 2015 ACM Computing Surveys (CSUR): Volume 48 Issue 1, September 2015
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 83,   Downloads (Overall): 561

Full text available: PDFPDF
An increased number of bio-inspired face recognition systems have emerged in recent decades owing to their intelligent problem-solving ability, flexibility, scalability, and adaptive nature. Hence, this survey aims to present a detailed overview of bio-inspired approaches pertaining to the advancement of face recognition. Based on a well-classified taxonomy, relevant bio-inspired ...
Keywords: bio-inspired computing, evolutionary algorithms, artificial neural networks, Face recognition, feature selection, optimization, swarm intelligence

6
July 2015 Fundamenta Informaticae - 9th edition of the international conference Bio-Inspired Computing: Theories and Applications, BIC-TA, 2014: Volume 136 Issue 3, July 2015
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

It is known that the Common Algorithmic Problem (CAP) has the nice property that several other NP-complete problems can be reduced to it in linear time. The decision version of this problem is known to be efficiently solved by a family of recognizer P systems with active membranes with three ...
Keywords: Common Algorithmic Problem, Membrane Computing, Minimal Parallelism, P System

7
May 2014 IWCIA 2014: Proceedings of the 16th International Workshop on Combinatorial Image Analysis - Volume 8466
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

Considering a large variety of approaches in generating picture languages, the notion of pure two-dimensional context-free grammar P 2 DCFG represents a simple yet expressive non-isometric language generator of picture arrays. In the present paper, we introduce a new variant of P 2 DCFG s that generates picture arrays in ...
Keywords: Context-free grammars, Array grammars, Pure grammars, Two-dimensional arrays

8
October 2013 Discrete Applied Mathematics: Volume 161 Issue 15, October, 2013
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

Among many grammar models for picture description, cooperating context-free distributed array grammar systems utilize the mechanism of cooperation between component array grammars. Here, we endow these grammar systems with the feature of permitting symbols, and examine the generative capacity of the resulting permitting cooperating context-free distributed array grammar systems with ...
Keywords: Array grammar systems, Array grammars, Generative models, Picture arrays, Two-dimensional languages

9
June 2013 Pattern Recognition Letters: Volume 34 Issue 8, June, 2013
Publisher: Elsevier Science Inc.
Bibliometrics:
Citation Count: 3

The presence of occlusions in facial images is inevitable in unconstrained scenarios. However recognizing occluded faces remains a partially solved problem in computer vision. In this contribution we propose a novel Bayesian technique inspired by psychophysical mechanisms relevant to face recognition to address the facial occlusion problem. For some individuals ...
Keywords: Face recognition, Machine learning, Similarity measures, Bayesian Network, Occlusion

10 published by ACM
October 2012 CCSEIT '12: Proceedings of the Second International Conference on Computational Science, Engineering and Information Technology
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Downloads (Overall): 67

Full text available: PDFPDF
Motivated by Watson-Crick automata, we introduce here a grammar counterpart called a Watson-Crick regular grammar that has rules as in a regular grammar but involves double stranded strings. The language generated by this grammar consists of strings in the upper strands of the double stranded strings related by a complementarity ...
Keywords: Watson-Crick complementarity, DNA computing, formal language, finite automaton

11
September 2011 BIC-TA '11: Proceedings of the 2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

Motivated by the studies on Watson-Crick finite automata and Watson-Crick L systems, we introduce a generative device known as a Watson-Crick context-free system (WKCFS) making use of a complementarity relation and a context-free type of rewriting on double-stranded strings with the symbols in the string in the lower strand complementary ...
Keywords: Watson-Crick complementarity, Watson-Crick finite automaton, Context-free language, Regular language, Pure context-free grammar

12
August 2011 CAIP'11: Proceedings of the 14th international conference on Computer analysis of images and patterns - Volume Part I
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Face recognition systems robust to major occlusions have wide applications ranging from consumer products with biometric features to surveillance and law enforcement applications. In unconstrained scenarios, faces are often subject to occlusions, apart from common variations such as pose, illumination, scale, orientation and so on. In this paper we propose ...
Keywords: parameter estimation, bayesian networks, similarity measures, face recognition, occlusion models

13
May 2011 IWCIA'11: Proceedings of the 14th international conference on Combinatorial image analysis
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Mateescu et al (2001) introduced the notion of Parikh matrix of a word as an extension of the well-known concept of Parikh vector of a word. The Parikh matrix provides more numerical information about a word than given by the Parikh vector. Here we introduce the notion of M -vector ...

14
December 2010 Mathematical and Computer Modelling: An International Journal: Volume 52 Issue 11-12, December, 2010
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

Syntactic models constitute one of the main areas of mathematical studies on picture array generation. A number of 2D grammar models have been proposed motivated by a variety of applications. A P system is a biologically motivated new computing model, proposed by Paun in the area of membrane computing. It ...
Keywords: 2D grammar, P system, Syntactic method, Picture array generation

15
May 2010 CompIMAGE'10: Proceedings of the Second international conference on Computational Modeling of Objects Represented in Images
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

Pasting System ( PS ) and Extended Pasting Scheme ( EPS ) are new techniques to generate tiling patterns by using pasting rules for gluing tiles at their edges. In this paper we introduce a Tabled Pasting System ( TPS ) based on the technique of suitably grouping the rules ...
Keywords: picture languages, P system, pasting system, two-dimensional pattern, syntactic methods

16
August 2009 Discrete Applied Mathematics: Volume 157 Issue 16, August, 2009
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 8

A new syntactic model, called pure two-dimensional (2D) context-free grammar (P2DCFG), is introduced based on the notion of pure context-free string grammar. The rectangular picture generative power of this 2D grammar model is investigated. Certain closure properties are obtained. An analogue of this 2D grammar model called pure 2D hexagonal ...
Keywords: Picture languages, Rectangular arrays, Hexagonal arrays, Pure grammars, Two-dimensional grammars

17
May 2009 AMS '09: Proceedings of the 2009 Third Asia International Conference on Modelling & Simulation
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 2

In the area of membrane computing, a new computability model, called P system, which is a distributed, highly parallel theoretical computing model, was introduced by Păun, inspired from the cell structure and its functioning. There are several application areas of these P systems. Among these one area deals with the ...
Keywords: Membrane Computing, P-System,

18
March 2009 UKSIM '09: Proceedings of the UKSim 2009: 11th International Conference on Computer Modelling and Simulation
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

Motivated by the structure and functioning of the livingcell, a new computing model, called P System, was proposedin the area of Membrane Computing. Among severalareas of application of P systems, one area is concernedwith generation of picture array languages. Ceterchiet al. [1] initially proposed array-rewriting P systemsby extending the notion ...
Keywords: Array P-System, Pure Context-free Rules, Membrane Computing

19
January 2009 Fundamenta Informaticae - Machines, Computations and Universality, Part I: Volume 91 Issue 1, April 2009
Publisher: IOS Press
Bibliometrics:
Citation Count: 1

The two areas of grammar systems and P systems, which have provided interesting computational models in the study of formal string language theory have been in the recent past effectively linked in [4] by incorporating into P systems, a communication mode called t-mode of cooperating distributed grammar systems. On the ...
Keywords: Picture languages, Array grammars, Grammar systems, P systems

20
January 2009 Fundamenta Informaticae - Machines, Computations and Universality, Part I: Volume 91 Issue 1, January 2009
Publisher: IOS Press
Bibliometrics:
Citation Count: 0

The two areas of grammar systems and P systems, which have provided interesting computational models in the study of formal string language theory have been in the recent past effectively linked in [4] by incorporating into P systems, a communication mode called t-mode of cooperating distributed grammar systems. On the ...
Keywords: Grammar systems, P systems, Picture languages, Array grammars



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us