S. V. Kasmir Raja

Learn More
Comprehensively searching for words in Sanskrit E-text is a non-trivial problem because words could change their forms in different contexts. One such context is sandhi or euphonic conjunctions, which cause a word to change owing to the presence of adjacent letters or words. The change wrought by these possible conjunctions can be so significant in Sanskrit(More)
– Searching for words in Sanskrit E-text is a problem that is accompanied by complexities introduced by features of Sanskrit such as euphonic conjunctions or 'sandhis'. A word could occur in an E-text in a transformed form owing to the operation of rules of sandhi. Simple word search would not yield these transformed forms of the word. Further, there is no(More)
The routing problems can be divided into two major classes. They are 1) Unicast routing and 2) Mul-ticast routing. The Unicast routing problem is as follows. Given a source node sr, a destination node dn, a set of QoS constraints qc and an optimization goal (optional), find the best feasible path from sr to dn, which satisfies qc. The Multicast routing(More)
Euphonic conjunctions (sandhis) form a very important aspect of Sanskrit morphology and phonology. The traditional and modern methods of studying about euphonic conjunctions in Sanskrit follow different methodologies. The former involves a rigorous study of the Pāṇinian system embodied in Pāṇini's Āṣtādhyāyī, while the latter usually involves the study of a(More)
Any node in a wireless sensor network is a resource constrained device in terms of memory, bandwidth, and energy, which leads to a large number of packet drops, low throughput, and significant waste of energy due to retransmission. This paper presents a new approach for predicting congestion using a probabilistic method and controlling congestion using new(More)