We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
Pawel Gajer, Michael T. Goodrich, Stephen G. Kobou...
A Reverse k-Nearest-Neighbor (RkNN) query finds the objects that take the query object as one of their k nearest neighbors. In this paper we propose new solutions for evaluating R...
—Crease surfaces are two-dimensional manifolds along which a scalar field assumes a local maximum (ridge) or a local minimum (valley) in a constrained space. Unlike isosurfaces, ...
In a multiuser system, independent time-varying channels among different users can be exploited to provide multiuser diversity (MUD) gain and increase the system throughput. For th...
The node selection for the migration of a mobile agent depends on the content of the referenced metadata in the naming space. The reliability of the migrated information is determ...