1728 search results - page 124 / 346 » The Accelerated Euclidean Algorithm |
128
click to vote
ISAAC
2000
Springer
15 years 6 months ago
2000
Springer
We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no...
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
In this paper we demonstrate that the support vector tracking (SVT) framework first proposed by Avidan is equivalent to the canonical Lucas-Kanade (LK) algorithm with a weighted E...
131
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
125
click to vote
JSAC
2008
15 years 3 months ago
2008
In this paper, we propose a new precoding algorithm for orthogonalized spatial multiplexing (OSM) systems over flatfading multiple-input multiple-output (MIMO) channels. The OSM sc...
143
click to vote
PAMI
2006
15 years 3 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...