339 search results - page 32 / 68 » Is the Euclidean algorithm optimal among its peers |
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
INFOVIS
1997
IEEE
14 years 27 days ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
In this work, we present a new method for generating a threshold structure. This kind of structure can be advantageously used in various halftoning algorithms such as clustered-do...
CORR
2011
Springer
13 years 14 days ago
2011
Springer
The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design...
KDD
2010
ACM
13 years 10 months ago
2010
ACM
We consider the problem of learning incoherent sparse and lowrank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the spa...