Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
To take full advantage of the increasingly used shared-memory multicore architectures, software algorithms will need to be parallelized over multiple threads. This means that thre...
— The maximum lifetime routing problem in wireless sensor networks has received increasing attention in recent years. One way is to formulate it as a linear programming problem b...
This paper develops algorithms to train support vector machines when training data are distributed across different nodes, and their communication to a centralized processing unit...
Pedro A. Forero, Alfonso Cano, Georgios B. Giannak...
Abstract— In this paper, the robustness of graspless manipulation (or nonprehensile manipulation) is investigated. We derive some new constraints for static frictional forces in ...