2542 search results - page 373 / 509 » Computing Cartograms with Optimal Complexity |
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
TC
2008
13 years 10 months ago
2008
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...
CVPR
2007
IEEE
15 years 10 days ago
2007
IEEE
A simple stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small s...
CVPR
2007
IEEE
15 years 10 days ago
2007
IEEE
Conventional mutual information (MI)-based registration using pixel intensities is time-consuming and ignores spatial information, which can lead to misalignment. We propose a met...
ECCV
2002
Springer
15 years 6 days ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...