545 search results - page 25 / 109 » Simultaneous approximation by greedy algorithms |
IJCV
2006
13 years 8 months ago
2006
We present a novel Object Recognition approach based on affine invariant regions. It actively counters the problems related to the limited repeatability of the region detectors, an...
PODS
2008
ACM
14 years 8 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
MLDM
2010
Springer
13 years 3 months ago
2010
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates...
ICA
2012
Springer
12 years 4 months ago
2012
Springer
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...