107 search results - page 12 / 22 » Near-optimal algorithms for unique games |
EDUTAINMENT
2007
Springer
14 years 1 months ago
2007
Springer
As many 3D on-line games appear, there is an increased need for simple and efficient techniques to create many new faces. This paper presents a new algorithm to composite 3D faces ...
ICASSP
2009
IEEE
13 years 5 months ago
2009
IEEE
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
TIT
2008
13 years 7 months ago
2008
This paper considers the maximization of information rates for the Gaussian frequency-selective interference channel, subject to power and spectral mask constraints on each link. T...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
GLOBECOM
2010
IEEE
13 years 5 months ago
2010
IEEE
In cognitive networks, since nodes generally belong to different authorities and pursue different goals, they will not cooperate with others unless cooperation can improve their ow...