78 search results - page 6 / 16 » Approximate earth mover's distance in linear time |
ICCV
1998
IEEE
15 years 11 months ago
1998
IEEE
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
FOCS
1999
IEEE
15 years 1 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
The success of tensor-based subspace learning depends heavily on reducing correlations along the column vectors of the mode-k flattened matrix. In this work, we study the problem ...
MICCAI
2008
Springer
15 years 10 months ago
2008
Springer
If imaging is to serve as a valid biomarker in the assessment of the response of cancer to therapies, a reproducible and predictive radiologic metric is required. A biomarker is an...
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...