1092 search results - page 163 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
198
click to vote
TRIER
2002
15 years 5 months ago
2002
It is known that interprocedural detection of copy constants and elimination of faint code in parallel programs are undecidable problems, if base statements are assumed to execute...
178
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
170
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
159
click to vote
FOCS
2006
IEEE
16 years 10 days ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
141
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...