251 search results - page 8 / 51 » Using self-dissimilarity to quantify complexity |
76
Voted
AMC
2008
14 years 11 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
93
Voted
ACL
2010
14 years 9 months ago
2010
Hierarchical HMM (HHMM) parsers make promising cognitive models: while they use a bounded model of working memory and pursue incremental hypotheses in parallel, they still achieve...
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
We consider the estimation of an unknown arbitrary 2D object shape from sparse noisy samples of its Fourier transform. The estimate of the closed boundarycurve is parametrized by ...
ECCC
2010
14 years 11 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...