2542 search results - page 62 / 509 » Computing Cartograms with Optimal Complexity |
124
click to vote
DAC
1997
ACM
15 years 6 months ago
1997
ACM
Cr, As the complexity of high-performance microprocessor increases, functional verification becomes more and more difficult and RTL simulation emerges as the bottleneck of the des...
120
click to vote
APWEB
2010
Springer
15 years 2 months ago
2010
Springer
SimRank has been proposed to rank web documents based on a graph model on hyperlinks. The existing techniques for conducting SimRank computation adopt an iteration computation para...
IPL
2006
15 years 2 months ago
2006
We show that computing the lexicographically first four-coloring for planar graphs is p 2hard. This result optimally improves upon a result of Khuller and Vazirani who prove this ...
112
click to vote
ICIP
2010
IEEE
15 years 14 days ago
2010
IEEE
Direct implementations of bilateral filtering show O(r2 ) computational complexity per pixel, where r is the filter window radius. Several lower complexity methods have been devel...
123
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...