73 search results - page 6 / 15 » swap 2007 |
GD
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes novel methods we developed to lay out graphs using Sugiyama’s scheme [16] in a tool named GLEE. The main contributions are: a heuristic for creating a graph ...
LCPC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. To solve problems that require far more memory than a single machine can supply, data can be swapped to disk in some manner, it can be compressed, and/or the memory of mu...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
ERSA
2006
13 years 8 months ago
2006
: Traditional FPGA architectures can potentially allow the dynamic swap in and out of hardware tasks through 2D partial reconfiguration. A segmented bus structure is proposed to be...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...