2542 search results - page 208 / 509 » Computing Cartograms with Optimal Complexity |
279
click to vote
PAMI
2010
14 years 11 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
112
click to vote
PE
2010
Springer
14 years 11 months ago
2010
Springer
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
100
Voted
SOCO
2010
Springer
14 years 11 months ago
2010
Springer
This article presents an algorithm for the automatic detection of circular shapes from complicated and noisy images without using the conventional Hough transform methods. The prop...
113
Voted
ICIP
2010
IEEE
14 years 10 months ago
2010
IEEE
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
108
click to vote
CCP
2011
14 years 20 days ago
2011
This project will involve analysing some of the newer fast algorithms in comparison with an exhaustive full search algorithm for motion estimation in video encoders. It will invest...