2109 search results - page 326 / 422 » Solving Necklace Constraint Problems |
144
click to vote
DAC
2008
ACM
16 years 5 months ago
2008
ACM
Achieving high performance under a peak temperature limit is a first-order concern for VLSI designers. This paper presents a new model of a thermally-managed system, where a stoch...
169
click to vote
ICML
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the problem of optimizing multilabel MRFs, which is in general NP-hard and ubiquitous in low-level computer vision. One approach for its solution is to formulate it as...
131
click to vote
STOC
2009
ACM
16 years 5 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
129
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
126
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider the offline version of the routing and wavelength assignment (RWA) problem in transparent all-optical networks. In such networks and in the absence of regenerators, ...