2629 search results - page 31 / 526 » complex 2009 |
FAW
2009
Springer
15 years 2 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
STACS
2009
Springer
15 years 2 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
BIBE
2009
IEEE
15 years 29 days ago
2009
IEEE
—The Possibilistic Latent Variable (PLV) clustering algorithm is a powerful tool for the analysis of complex datasets due to its robustness toward data distributions of different...
AIPS
2009
14 years 10 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
104
click to vote
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
Image registration is considered one of the most fundamental and crucial pre-processing tasks in digital imaging. This paper describes a fast multimodal automatic image registrati...