5153 search results - page 326 / 1031 » Introduction to Randomized Algorithms |
129
click to vote
IBPRIA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper presents an algorithm for the estimation of multiple regions with unknown shapes and positions using multiple active contour models (ACM’s). The algorithm or...
127
click to vote
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
158
click to vote
JMLR
2010
15 years 2 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
131
click to vote
ICIP
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose an algorithm for the binarization of document images degraded by uneven light distribution, based on the Markov Random Field modeling with Maximum A Posteriori probabil...
164
click to vote
MOBIHOC
2012
ACM
13 years 6 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...