Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
Galileo Namata, Brian Staats, Lise Getoor, Ben Shn...
We presenta group of methods of decomposingan arbitrary 3D volume rotation into a sequenceof simple shear(i.e., regular shift) operations. We explore different types of shear oper...
In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, d...
This paper examines MPI’s ability to support continuous, dynamic load balancing for unbalanced parallel applications. We use an unbalanced tree search benchmark (UTS) to compare...
James Dinan, Stephen Olivier, Gerald Sabin, Jan Pr...