1728 search results - page 40 / 346 » The Accelerated Euclidean Algorithm |
119
click to vote
ISSS
1995
IEEE
15 years 2 months ago
1995
IEEE
To construct complete systems on silicon, application speci c DSP accelerators are needed to speed up the execution of high throughput DSP algorithms. In this paper, a methodology...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
116
click to vote
VLSID
2008
IEEE
15 years 11 months ago
2008
IEEE
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...
ICTAI
2006
IEEE
15 years 5 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
104
click to vote
SI3D
2010
ACM
15 years 6 months ago
2010
ACM
We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the i...