![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
K. M. Mehata
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
- [j6]Saira Banu, K. M. Mehata:
SIP-based VoIP anomaly detection engine using DTV and ONR. Int. J. Netw. Virtual Organisations 19(2/3/4): 234-256 (2018) - 2014
- [j5]Govindarajalu Bakthavatsalam, K. M. Mehata:
A Case for Hybrid Instruction Encoding for Reducing Code Size in Embedded System-on-Chips based on RISC Processor Cores. J. Comput. Sci. 10(3): 411-422 (2014) - 2011
- [j4]K. Vimala Devi, C. Thangaraj, K. M. Mehata:
Resource Control and Estimation Based Fair Allocation (EBFA) in Heterogeneous Active Networks. Informatica (Slovenia) 35(1): 101-112 (2011) - 2009
- [j3]K. Vimala Devi
, K. M. Mehata, S. Radhakrishnan:
Resource prediction and management in active networks. Int. J. Netw. Manag. 19(1): 57-74 (2009) - 2002
- [j2]V. Uma Maheswari, Arul Siromoney, K. M. Mehata:
Mining Web Usage Graphs Using Example Search Space. Int. J. Comput. Intell. Appl. 2(2): 209-220 (2002) - 2001
- [j1]V. Uma Maheswari, Arul Siromoney, K. M. Mehata, Katsushi Inoue:
The Variable Precision Rough Set Inductive Logic Programming Model and Strings. Comput. Intell. 17(3): 460-471 (2001)
Conference and Workshop Papers
- 2017
- [c8]X. Arputha Rathina, M. Ponnavaikko, K. M. Mehata, Muthu Subash Kavitha
:
Analysis of User's Behavior Using Markov Model. SocProS (2) 2017: 405-423 - 2012
- [c7]D. Venkata Subramanian, Angelina Geetha
, K. M. Mehata, K. Mohammed Hussain:
KM System Evaluation - A Hybrid Approach Using Four Dimension Metric Database and WAM. ACITY (3) 2012: 329-337 - 2008
- [c6]K. Vimala Devi
, K. M. Mehata:
A priority based resource allocation with max-min fairness in active sensor networks. ICON 2008: 1-7 - 2006
- [c5]K. Vimala Devi
, K. M. Mehata:
Resource Estimation and Policy Based Allocation for Quality of Service in Active Networks. ICON 2006: 1-6 - 2005
- [c4]K. Vimala Devi, K. M. Mehata:
Resource Management in Active Networks. PDPTA 2005: 24-30 - 2004
- [c3]D. Loganathan, K. M. Mehata:
3D Image Sensing for Bit Plane Method of Progressive Transmission. 3DPVT 2004: 91-94 - 2001
- [c2]V. Uma Maheswari, Arul Siromoney, K. M. Mehata:
The Variable Precision Rough Set Inductive Logic Programming Model and Web Usage Graphs. JSAI Workshops 2001: 339-343 - [c1]V. Uma Maheswari, Arul Siromoney, K. M. Mehata:
The Variable Precision Rough Set Model for Web Usage Mining. Web Intelligence 2001: 520-524
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-04-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint