Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
—The Morse-Smale complex is a useful topological data structure for the analysis and visualization of scalar data. This paper describes an algorithm that processes all mesh eleme...
Nithin Shivashankar, Senthilnathan M, Vijay Natara...
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
Abstract. Context-aware computing involves the automatic tailoring of information and services based on the current location of the user. In this paper, we describe our experience ...
Tamer Nadeem, Adel M. Youssef, Suman Banerjee, Mou...
In mobile ad hoc networks, nodes interact peer-to-peer. They self-organize, share workloads and provide services that they also use. There are middleware platforms, designed for t...