105 search results - page 2 / 21 » Almost Optimal Solutions to k-Clustering Problems |
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
102
click to vote
IPCO
2007
15 years 1 months ago
2007
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
116
click to vote
ICDE
2010
IEEE
15 years 6 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
99
Voted
PDPTA
2000
15 years 1 months ago
2000
In this paper, a parallel evolutionary multi-criteria optimization algorithm: DGA and DRMOGA are applied to block layout problems. The results are compared to the results of SGA an...