Sciweavers

1728 search results - page 105 / 346
» The Accelerated Euclidean Algorithm
Sort
View
DGCI
2006
Springer
15 years 6 months ago
Generating Distance Maps with Neighbourhood Sequences
A sequential algorithm for computing the distance map using distances based on neighbourhood sequences (of any length) in the 2D square grid; and 3D cubic, face-centered cubic, and...
Robin Strand, Benedek Nagy, Céline Fouard, ...
143
Voted
JMLR
2006
206views more  JMLR 2006»
15 years 2 months ago
New Algorithms for Efficient High-Dimensional Nonparametric Classification
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
Ting Liu, Andrew W. Moore, Alexander G. Gray
ACCV
2006
Springer
15 years 9 months ago
Boosted Algorithms for Visual Object Detection on Graphics Processing Units
Nowadays, the use of machine learning methods for visual object detection has become widespread. Those methods are robust. They require an important processing power and a high mem...
Hicham Ghorayeb, Bruno Steux, Claude Laurgeau
COMPGEOM
2008
ACM
15 years 4 months ago
Circular partitions with applications to visualization and embeddings
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
Krzysztof Onak, Anastasios Sidiropoulos
ISBI
2004
IEEE
16 years 3 months ago
A Hierarchical Algorithm for Fast Backprojection in Helical Cone-Beam Tomography
Existing algorithms for exact helical cone beam (HCB) tomographic reconstruction involve a 3-D backprojection step, which dominates the the computational cost of the algorithm. We...
Jeffrey Brokish, Yoram Bresler