Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms w...
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
Amruta Joshi, Ravi Kumar, Benjamin Reed, Andrew To...
— This paper examines stability properties of distance-based formations. These are formations encoded by inter-agent relative distances. A negative gradient control law is propos...
Unstructured P2P networks can grow in an ad-hoc and give rise to scale-free graphs where most of the nodes form clusters or hubs around few resourceful nodes. This leads to conges...
— This paper proposes a necessary and sufficient condition for parallel grasps. We extend the use of this condition to the task of regrasp planning. In particular, we propose a ...