10608 search results - page 677 / 2122 » Complexity of O'Hara's Algorithm |
198
Voted
TSP
2008
15 years 7 months ago
2008
We consider sequential regression of individual sequences under the square error loss. Using a competitive algorithm framework, we construct a sequential algorithm that can achieve...
176
click to vote
CSUR
2004
15 years 7 months ago
2004
Bresenham's algorithm minimizes error in drawing lines on integer grid points; leap year calculations, surprisingly, are a generalization. We compare the two calculations, exp...
183
Voted
PAMI
1998
15 years 7 months ago
1998
—Visualization has proven to be a powerful and widely-applicable tool for the analysis and interpretation of multivariate data. Most visualization algorithms aim to find a projec...
196
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
188
Voted
ECCV
2006
Springer
16 years 9 months ago
2006
Springer
Abstract. We introduced an algorithm for sequence alignment, based on maximizing local space-time correlations. Our algorithm aligns sequences of the same action performed at diffe...