1161 search results - page 111 / 233 » Approximation schemes for clustering problems |
134
click to vote
AIPR
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper, we analyze the perturbation in the reconstructed optical absorption images, resulting from the discretization of the forward and inverse problems. We show that the ...
124
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
ICSPEA is a novel multi-objective evolutionary algorithm which integrates aspects from the powerful variation operators of the Covariance Matrix Adaptation Evolution Strategy (CMA...
140
Voted
GLOBECOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Fault tolerance techniques have been widely used in wireless sensor networks. Base station placement to maximize the network lifetime has also been well studied. However, limite...
123
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
In this paper we develop an efficient implementation for a k-means clustering algorithm. The novel feature of our algorithm is that it uses coresets to speed up the algorithm. A ...
139
click to vote
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...