2520 search results - page 260 / 504 » The complexity of approximating entropy |
164
click to vote
TCAD
2008
15 years 6 months ago
2008
Abstract--Recent analytical global placers use density constraints to approximate nonoverlap constraints, and these show very successful results. This paper unifies a wide range of...
199
click to vote
NETWORKS
2010
15 years 5 months ago
2010
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
178
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomiz...
198
click to vote
JC
2011
15 years 1 months ago
2011
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
173
click to vote
JMLR
2010
15 years 1 months ago
2010
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...