5115 search results - page 318 / 1023 » On Randomized Lanczos Algorithms |
175
click to vote
JMLR
2010
15 years 2 months ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
187
click to vote
IBPRIA
2007
Springer
16 years 1 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...
174
click to vote
SODA
2004
ACM
15 years 8 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, ...
227
click to vote
JMLR
2010
15 years 5 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...
190
click to vote
ICIP
2008
IEEE
16 years 1 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...