Abstract—We first present a problem called precedence constrained two traveling salesman (PC2TSP). We propose a nearoptimal heuristic to PC2TSP to generate tours by clustering p...
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...
Abstract—In distributed environments, access control decisions depend on statements of multiple agents rather than only one central trusted party. However, existing policy langua...
The development of high-level programming environments is essential if wireless sensor networks are to be accessible to nonexperts. In this paper, we present the Regiment system, ...
: Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extrac...