1399 search results - page 38 / 280 » New Algorithms for k-Center and Extensions |
MICCAI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Image segmentation algorithms derived from spectral clustering analysis rely on the eigenvectors of the Laplacian of a weighted graph obtained from the image. The NCut cr...
AINA
2004
IEEE
14 years 1 months ago
2004
IEEE
The lack of end-to-end quality of service support in the current Internet has caused significant difficulties to ensuring playback continuity in video streaming applications. This...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
AE
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
MP
2010
13 years 7 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...