1399 search results - page 38 / 280 » New Algorithms for k-Center and Extensions |
158
click to vote
MICCAI
2005
Springer
15 years 11 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...
137
click to vote
AINA
2004
IEEE
15 years 9 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...
171
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Bisubmodular functions are a natural "directed", or "signed", extension of submodular functions with several applications. Recently Fujishige and Iwata showed ...
180
click to vote
AE
2009
Springer
15 years 6 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...
156
Voted
MP
2010
15 years 3 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...