792 search results - page 47 / 159 » Measuring complexity by measuring structure and organization |
WWW
2010
ACM
15 years 3 months ago
2010
ACM
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
KES
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this work we propose a fuzzy technique to compare XML documents belonging to a semi-structured flow and sharing a common vocabulary of tags. Our approach is based on t...
MICCAI
2002
Springer
15 years 10 months ago
2002
Springer
Abstract. We investigate new approaches to quantifying the white matter connectivity in the brain using Diffusion Tensor Magnetic Resonance Imaging data. Our first approach finds a...
CIE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
ICALP
2003
Springer
15 years 3 months ago
2003
Springer
Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string. The Kolmogorov structure function divides the s...