Papers by Prameela Kolake TAB
International Electronic Journal of Pure and Applied Mathematics, 2013
Linguistics knowledge representation and its relation to context abstraction are presented in bri... more Linguistics knowledge representation and its relation to context abstraction are presented in brief. Nourani (e.g. Nourani 1999a) has put forth new visual computing techniques for intelligent multimedia context abstraction with linguistics components.In the present paper we also instantiate proof tree leaves with free Skolemized trees. Thus virtual trees, at times like intelligent trees, are substituted for the leaves. By a virtual tree we mean a term made up of constant symbols and named but not always prespecified Skolem function terms. In virtual planning with generic diagrams that part of the plan that involves free Skolemized trees is carried along with the proof tree for a plan goal. We can apply predictive model diagrams to compute queries and discover data knowledge from observed data and visual object images keyed with diagram functions. Model-based computing can be applied to automated data and knowledge engineering with keyed diagrams. Specific computations can be carried out with predictive model diagrams. For cognition, planning, and learning the robot's mind, a diagram grid can define state. The starting space applicable project was meant for an autonomous robots space journeys.
Maximin Degree Domination Number in Graphs
Journal of International Academy Of Physical Sciences, 2012
クローン病における疾患腸管セグメントの経腹部および水浸超音波画像の一貫性 jst 京大機械翻訳
Diagnostics (Web), 2020
Laplacian Energy of Induced Complement of Complete and Star Graphs
Materials Today: Proceedings
Neighborhood contraction in graphs
Indian Journal of Pure and Applied Mathematics, 2016
Let G be a graph and v be any vertex of G. Then the neighborhood contracted graphGv of G, with re... more Let G be a graph and v be any vertex of G. Then the neighborhood contracted graphGv of G, with respect to the vertex v, is the graph with vertex set V − N(v), where two vertices u,w ∈ V − N(v) are adjacent in Gv if either w = v and u is adjacent to any vertex of N(v) in G or u,w ∉ N[v] and u,w are adjacent in G. The properties of the neighborhood contracted graphs are discussed in this paper. The neighborhood contraction in some special class of graphs, the domination in a graph and the neighborhood contracted graphs are discussed in the paper.
Neighborhood contraction in graphs
Indian Journal of Pure and Applied Mathematics, 2016
Uploads
Papers by Prameela Kolake TAB