843 search results - page 120 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
TSP
2010
13 years 2 months ago
2010
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
As a well known fixed-point iteration algorithm for kernel
density mode-seeking, Mean-Shift has attracted wide attention
in pattern recognition field. To date, Mean-Shift algorit...
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
Appropriate rate control plays a very important role in encoding motion pictures under the constant bit-rate. One of the requirements for rate control is minimizing temporal fluct...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Sparse coding--that is, modelling data vectors as sparse linear combinations of basis elements--is widely used in machine learning, neuroscience, signal processing, and statistics...