173 search results - page 32 / 35 » Every color chromakey |
GI
2008
Springer
15 years 24 days ago
2008
Springer
: This project sets a discussion about possible improvements for mobile menu structuring. Navigation on mobile phones is supposed to get quicker and easier. To reach for better use...
86
Voted
STOC
2009
ACM
16 years 10 days ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
100
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
115
click to vote
ATAL
2010
Springer
15 years 26 days ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...