2542 search results - page 281 / 509 » Computing Cartograms with Optimal Complexity |
86
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
Inspired by tensor voting, we present luminance voting, a novel approach for image registration with global and local luminance alignment. The key to our modeless approach is the ...
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
121
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
129
click to vote
STOC
2004
ACM
16 years 24 days ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
114
click to vote
CIBCB
2008
IEEE
15 years 7 months ago
2008
IEEE
— The genetic causes of many monogenic diseases have already been discovered. However, most common diseases are actually the result of complex nonlinear interactions between mult...