1728 search results - page 10 / 346 » The Accelerated Euclidean Algorithm |
170
Voted
CODES
2006
IEEE
15 years 9 months ago
2006
IEEE
To meet the conflicting goals of high-performance low-cost embedded systems, critical application loop nests are commonly executed on specialized hardware accelerators. These loop...
164
Voted
TCS
2010
15 years 4 months ago
2010
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
199
Voted
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
158
click to vote
ERSA
2008
15 years 7 months ago
2008
This paper presents an accelerator for k-th nearest neighbor thinning, a run time intensive algorithmic kernel used in recent multi-objective optimizers. We discuss the thinning al...
137
Voted
SODA
2001
ACM
15 years 7 months ago
2001
ACM
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of ...