1672 search results - page 132 / 335 » Tightness problems in the plane |
104
click to vote
GECCO
2009
Springer
14 years 9 months ago
2009
Springer
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
109
click to vote
GLOBECOM
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper, we design the optimal precoding matrices for amplify-and-forward (AF) multiple-input multipleoutput (MIMO) relay networks. Specifically, we consider a dualhop relay ...
134
click to vote
JMLR
2012
13 years 1 months ago
2012
An important form of prior information in clustering comes in form of cannot-link and must-link constraints. We present a generalization of the popular spectral clustering techniq...
FOCS
2009
IEEE
15 years 5 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
104
click to vote
SODA
1992
ACM
15 years 9 days ago
1992
ACM
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...