2080 search results - page 94 / 416 » Measuring empirical computational complexity |
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
82
Voted
ICPR
2004
IEEE
16 years 29 days ago
2004
IEEE
This paper introduces a novel measure for object convexity using the recently introduced Multi-Scale Autoconvolution transform. The proposed measure is computationally efficient a...
124
click to vote
Lecture Notes
These notes cover several topics such as Money Demand (and some Supply), The Price of Money, Derivations of the Pricing Relations, Money and Sticky Prices: A First Look, Money in M...
ECCV
2004
Springer
15 years 5 months ago
2004
Springer
Computer vision methods can be applied to a variety of medical and surgical applications, and many techniques and algorithms are available that can be used to recover 3D shapes and...
120
click to vote
CRYPTO
2007
Springer
15 years 6 months ago
2007
Springer
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...