583 search results - page 78 / 117 » A Meta-Study of Algorithm Visualization Effectiveness |
122
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
ICIP
2008
IEEE
15 years 6 months ago
2008
IEEE
—Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms usi...
3DPVT
2006
IEEE
15 years 5 months ago
2006
IEEE
In this paper we propose a novel framework for efficiently extracting foreground objects in so called shortbaseline image sequences. We apply the obtained segmentation to improve...
PAMI
2008
14 years 11 months ago
2008
Beyond conventional linear and kernel-based feature extraction, we present a more generalized formulation for feature extraction in this paper. Two representative algorithms using ...
JMM2
2007
14 years 11 months ago
2007
— In this paper we are proposing an improved cut detection algorithm adapted to the animation movies domain. A cut is the direct concatenation of two different shots and produces...