604 search results - page 87 / 121 » On the Complexity of the Maximum Cut Problem |
98
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic q...
78
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
2006
IEEE
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
104
click to vote
SIGECOM
2011
ACM
14 years 14 days ago
2011
ACM
In a landmark paper, Papadimitriou and Roughgarden [2008] described a polynomial-time algorithm (“Ellipsoid Against Hope”) for computing sample correlated equilibria of concis...
NIPS
2008
14 years 11 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
104
click to vote
NETWORKING
2007
14 years 11 months ago
2007
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...