165 search results - page 2 / 33 » Solving the Region Growing Problem on the Connection Machine |
HPDC
2007
IEEE
14 years 18 days ago
2007
IEEE
Tightly coupled parallel applications are increasingly run in Grid environments. Unfortunately, on many Grid sites the ability of machines to create or accept network connections ...
CVPR
2007
IEEE
14 years 8 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
In this paper, we consider a variation of the Euclidean Steiner Tree Problem in which the space underlying the set of nodes has a specified non-uniform cost structure. This proble...
SC
1993
ACM
13 years 10 months ago
1993
ACM
This paper documents the use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave struct...
IWSOS
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. A fundamental problem of future networks is to get fully selforganized routing protocols with good scalability properties that produce good paths in a wide range of netwo...