2520 search results - page 46 / 504 » The complexity of approximating entropy |
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract—It is often claimed that future systems will necessarily be all-optical, because electronic devices are not fast enough to keep up with the increase in fiber capacity. ...
TCS
2002
14 years 9 months ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
FSS
2010
14 years 8 months ago
2010
In this paper we extend the geometric approach to the theory of evidence in order to include the class of necessity measures, represented on a finite domain of “frame” by con...
104
click to vote
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we presentan approach to clustering images for efficient retrieval using relative entropy. We start with the assumption that visual features are represented by prob...
COMPLEX
2009
Springer
15 years 1 months ago
2009
Springer
The causal states of computational mechanics define the minimal sufficient (prescient) memory for a given stationary stochastic process. They induce the -machine which is a hidden...