1058 search results - page 21 / 212 » It's Doomed; We Can Prove It |
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
WIOPT
2010
IEEE
13 years 8 months ago
2010
IEEE
—It has been shown that the well-known cutset bounds can be achieved for deterministic wireless networks by performing random coding at each intermediate node. The complexity and...
LICS
1997
IEEE
14 years 2 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
JMLR
2010
13 years 8 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
In this paper we investigate the regularization property of Kernel Principal Component Analysis (KPCA), by studying its application as a preprocessing step to supervised learning ...