Sublinear Time Algorithms for Earth Mover’s Distance

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.48, Iss.2, 2011-02, pp. : 428-442

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

New Algorithms of Distance-Increasing Mappings from Binary Vectors to Permutations by Swaps

By Chang Jen-Chun

Designs, Codes and Cryptography, Vol. 39, Iss. 3, 2006-06 ,pp. : 335-345

Springer Publishing Company

Access to resources Recommend Favorite

Linear Time Algorithms for Parallel Machine Scheduling

By Tan Zhi He Yong

Acta Mathematica Sinica, Vol. 23, Iss. 1, 2007-01 ,pp. : 137-146

Springer Publishing Company

Access to resources Recommend Favorite

On the computational algorithms for time-lag optimal control problems

Bulletin of the Australian Mathematical Society, Vol. 32, Iss. 2, 1985-10 ,pp. : 309-311

Cambridge University Press

Access to resources Recommend Favorite

Sublinear Fully Distributed Partition with Applications

By Derbel Bilel

Theory of Computing Systems, Vol. 47, Iss. 2, 2010-08 ,pp. : 368-404

Springer Publishing Company

Access to resources Recommend Favorite

On the Inner and Outer Norms of Sublinear Mappings

By Aragón Artacho F.

Set-Valued Analysis, Vol. 15, Iss. 1, 2007-03 ,pp. : 61-65

Springer Publishing Company

Access to resources Recommend Favorite