9842 search results - page 363 / 1969 » The Complexity of the Matching-Cut Problem |
129
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
144
Voted
DOCENG
2003
ACM
15 years 9 months ago
2003
ACM
This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an a...
129
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
137
click to vote
SIGMETRICS
2010
ACM
15 years 9 months ago
2010
ACM
Perhaps surprisingly, no practical performance models exist for popular (and complex) client applications such as Adobe’s Creative Suite, Microsoft’s Office and Visual Studio...
155
click to vote
EWSPT
2001
Springer
15 years 8 months ago
2001
Springer
We describe an approach based upon software process technology to on-the-fly monitoring, redeployment, reconfiguration, and in general dynamic adaptation of distributed software ap...