This paper presents a new algorithm for clustering. It is an generalisation of the K-means algorithms . Each cluster will be represented by a chain of prototypes instead of being r...
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
In this paper, we describe our work on classification of players in Massively Multiplayer Online Games using Hidden Markov Models based on player action sequences. In our previous ...
The objective of the proposed work is to formally specify and implement a federated web service model in which the identity management problem and security features are analyzed. ...
S. Chandrasekaran, C. Dinesh, Kartic Ramesh, Al. M...
With the rapid growth in wireless networks and sensor and mobile devices, we are moving towards an era of pervasive computing. Access control is challenging in these environments. ...