787 search results - page 45 / 158 » Polynomial Constants are Decidable |
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
We propose a Polynomial-based scheme that addresses the problem of Event Region Detection (PERD) for wireless sensor networks (WSNs). Nodes of an aggregation tree perform function ...
COCOON
2005
Springer
14 years 1 months ago
2005
Springer
We consider the problem of finding a balanced ordering of the vertices of a graph. More precisely, we want to minimise the sum, taken over all vertices v, of the difference betwe...
ICALP
2010
Springer
14 years 25 days ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
INFORMATICALT
2010
13 years 6 months ago
2010
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...