3049 search results - page 390 / 610 » On the Convergence of Bound Optimization Algorithms |
170
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
142
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Existing metrics for dynamic optimisation are designed primarily to rate an algorithm’s overall performance. These metrics show whether one algorithm is better than another, but...
141
click to vote
TIP
2010
14 years 11 months ago
2010
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
130
click to vote
CPM
1999
Springer
15 years 9 months ago
1999
Springer
This paper examines some of the rich structure of the syntenic distance model of evolutionary distance, introduced by Ferretti et al. (1996). The syntenic distance between two gen...
161
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...