1091 search results - page 83 / 219 » Approximation Algorithms for Data Placement Problems |
214
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
108
click to vote
CVPR
2012
IEEE
13 years 5 months ago
2012
IEEE
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
118
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
145
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
We present a distributed machine learning framework based on support vector machines that allows classification problems to be solved iteratively through parallel update algorithm...
116
Voted
ICCV
2005
IEEE
16 years 4 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...