Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Gift Siromoney

dblp:62/2736 · DBLP profile ↗
← Back
10ranked-venue papers
7as first author
0since 2021 · last 1985
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
4 papers
Automata and formal languages · 79% Information theory · 21%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automata and formal languages › formal grammars
array grammar
0.021977
Extended Controlled Table L-Arrays · Inf. Control. 1977
Picture Languages with Array Rewriting Rules · Inf. Control. 1973
Automata and formal languages › formal language classes
picture languages
0.011973
Picture Languages with Array Rewriting Rules · Inf. Control. 1973
Information theory › information measures
entropy
0.021968
A Note on Entropy of Telugu Prose · Inf. Control. 1968
Entropy of Tamil Prose · Inf. Control. 1963
Information theory › information measures › entropy › source entropy
language entropy
0.011963
Entropy of Tamil Prose · Inf. Control. 1963

Methods — techniques the papers use, named apart from their topics

array rewriting rules · 0.0array rewriting · 0.0entropy estimation · 0.0
YearPublicationVenuePosition
1985 A note on an extension of matrix grammars generating two-dimensional languages
K. G. Subramanian 0001, Rani Siromoney, Gift Siromoney
Inf. Sci.3
1983 Machine recognition of Brahmi script
abstract
Computer recognition of machine-printed characters of the Brahmi alphabet is described. Each character is converted manually into a rectangular binary array in which a zero represents a blank, and a one, a nonblank. Features in the form of strings are extracted by row-wise and columnwise scanning of the array, depending upon the number and nature of the runs of ones in the rows and columns. Feature strings of the characters of the Brahmi alphabet form a dictionary. A given text is presented character by character, and features are extracted in the form of strings and compared with the strings in the dictionary. When there is perfect agreement, the letters are recognized and printed in Roman, following a special method of transliteration.
Gift Siromoney, Ramaswamy Chandrasekaran
IEEE Trans. Syst. Man Cybern.1
1982 Stochastic table arrays
Gift Siromoney, Rani Siromoney, K. G. Subramanian 0001
Comput. Graph. Image Process.1
1978 Computer recognition of printed Tamil characters
Gift Siromoney, Ramaswamy Chandrasekaran
Pattern Recognit.1
1977 Extended Controlled Table L-Arrays
Rani Siromoney, Gift Siromoney
Inf. Control.2
1974 Array Grammars and Kolam
Gift Siromoney, Rani Siromoney, Kamala Krithivasan
Comput. Graph. Image Process.1
1973 Picture Languages with Array Rewriting Rules
Gift Siromoney, Rani Siromoney, Kamala Krithivasan
Inf. Control.1
1972 Abstract families of matrices and picture languages
Gift Siromoney, Rani Siromoney, Kamala Krithivasan
Comput. Graph. Image Process.1
1968 A Note on Entropy of Telugu Prose
P. Balasubrahmanyam, Gift Siromoney
Inf. Control.2
1963 Entropy of Tamil Prose
Gift Siromoney
Inf. Control.1