2542 search results - page 303 / 509 » Computing Cartograms with Optimal Complexity |
121
Voted
CVPR
2008
IEEE
16 years 4 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...
154
Voted
CVPR
2006
IEEE
15 years 6 months ago
2006
IEEE
A wide range of computer vision applications such as distance field computation, shape from shading, and shape representation require an accurate solution of a particular Hamilton...
142
Voted
MM
2010
ACM
15 years 2 months ago
2010
ACM
Reliable delivery of 3D video contents to a wide set of users is expected to be the next big revolution in multimedia applications provided that it is possible to grant a certain ...
117
click to vote
EOR
2008
15 years 2 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
113
Voted
ASPDAC
2007
ACM
15 years 6 months ago
2007
ACM
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...