1717 search results - page 323 / 344 » A Computable Spectral Theorem |
94
Voted
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
102
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
137
Voted
STACS
1993
Springer
15 years 4 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
143
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We prove the existence of tolls to induce multicommodity, heterogeneous network users that independently choose routes minimizing their own linear function of tolls versus latency...
106
Voted
CVPR
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...