3255 search results - page 498 / 651 » Clustering moving objects |
167
click to vote
CGF
2010
15 years 6 months ago
2010
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...
132
click to vote
CGF
2006
15 years 5 months ago
2006
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provi...
178
click to vote
EOR
2006
15 years 5 months ago
2006
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
151
click to vote
IJHPCA
2006
15 years 5 months ago
2006
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
173
click to vote
IJSEKE
2006
15 years 5 months ago
2006
tion and alteration of software models at different levels of abstraction. These modifications are usually performed independently, but the objects to which they are applied to, ar...