6365 search results - page 432 / 1273 » Fast Local Computation Algorithms |
183
click to vote
ICCD
2001
IEEE
16 years 4 months ago
2001
IEEE
Classical floorplanning minimizes a linear combination of area and wirelength. When Simulated Annealing is used, e.g., with the Sequence Pair representation, the typical choice o...
202
click to vote
CGF
2010
15 years 7 months ago
2010
The technique of Delaunay refinement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one la...
191
click to vote
MICCAI
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. Modern morphometric studies use non-linear image registration to compare anatomies and perform group analysis. Recently, logEuclidean approaches have contributed to promo...
174
click to vote
IPPS
2005
IEEE
16 years 1 months ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
218
click to vote
SODA
2008
ACM
15 years 9 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...