11565 search results - page 48 / 2313 » Computing Minimal Mappings |
ENDM
2008
15 years 2 months ago
2008
This paper shows that a well-known algorithm proposed to compute the canonical polygonal schema of a surface can be transferred onto a 2-dimensional generalized map. We show that ...
EUROPAR
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. When parallelizing loop nests for distributed memory parallel computers, we have to specify when the different computations are carried out (computation scheduling), wher...
112
click to vote
ACCV
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
105
click to vote
ICDCS
1997
IEEE
15 years 6 months ago
1997
IEEE
The virtual synchrony model for group communication has proven to be a powerful paradigm for building distributed applications. In applications that use a large number of groups, ...
DATE
2004
IEEE
15 years 5 months ago
2004
IEEE
Tile-based data layout has been applied to achieve various objectives such as minimizing cache conflicts and memory row switching activity. In some applications of tilebased mappi...