1728 search results - page 132 / 346 » The Accelerated Euclidean Algorithm |
332
click to vote
ICDAR
2011
IEEE
14 years 2 months ago
2011
IEEE
—In this paper we present a novel approach for fast search of handwritten Arabic word-parts within large lexicons. The algorithm runs through three steps to achieve the required ...
113
click to vote
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
ISCAS
2007
IEEE
15 years 9 months ago
2007
IEEE
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
130
click to vote
ICCSA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edg...
110
click to vote
ISAAC
2003
Springer
15 years 8 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...