2542 search results - page 233 / 509 » Computing Cartograms with Optimal Complexity |
123
click to vote
ICCV
2009
IEEE
16 years 8 months ago
2009
IEEE
Capturing multiple photos at different focus settings is a powerful approach for reducing optical blur, but how many photos should we capture within a fixed time budget? We develop...
125
click to vote
IPPS
2007
IEEE
15 years 9 months ago
2007
IEEE
Computational phylogeny is a challenging application even for the most powerful supercomputers. It is also an ideal candidate for benchmarking emerging multiprocessor architecture...
106
click to vote
SPAA
2004
ACM
15 years 8 months ago
2004
ACM
Given two admission control algorithms that are cA-acceptcompetitive and cR-reject-competitive respectively, we give two ways to make an algorithm that is simultaneously O(cA)acce...
128
click to vote
BMVC
2010
2010
Improved Anatomical Landmark Localization in Medical Images Using Dense Matching of Graphical Models
15 years 1 months ago
We propose a method for reliably and accurately identifying anatomical landmarks in 3D CT volumes based on dense matching of parts-based graphical models. Such a system can be use...
143
click to vote
SAC
2004
ACM
15 years 8 months ago
2004
ACM
The selection of a cost-minimizing combination of hardware and network components that satisfy organizational requirements is a complex design problem with multiple degrees of fre...