434 search results - page 48 / 87 » A Semantic Caching Method Based on Linear Constraints |
GD
2005
Springer
14 years 2 months ago
2005
Springer
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...
WCET
2010
13 years 6 months ago
2010
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...
GLOBECOM
2007
IEEE
14 years 3 months ago
2007
IEEE
— 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...
JMLR
2010
13 years 3 months ago
2010
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...
ICRA
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— In this paper, the robustness of graspless manipulation (or nonprehensile manipulation) is investigated. We derive some new constraints for static frictional forces in ...