Sciweavers

53 search results - page 10 / 11
» Compression of Probabilistic XML Documents
Sort
View
IPM
2007
95views more  IPM 2007»
13 years 5 months ago
Using structural contexts to compress semistructured text collections
We describe a compression model for semistructured documents, called Structural Contexts Model (SCM), which takes advantage of the context information usually implicit in the stru...
Joaquín Adiego, Gonzalo Navarro, Pablo de l...
WWW
2008
ACM
14 years 6 months ago
Learning deterministic regular expressions for the inference of schemas from XML data
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
Geert Jan Bex, Wouter Gelade, Frank Neven, Stijn V...
BMCBI
2007
147views more  BMCBI 2007»
13 years 5 months ago
Comparative analysis of long DNA sequences by per element information content using different contexts
Background: Features of a DNA sequence can be found by compressing the sequence under a suitable model; good compression implies low information content. Good DNA compression mode...
Trevor I. Dix, David R. Powell, Lloyd Allison, Jul...
ICDE
2010
IEEE
263views Database» more  ICDE 2010»
14 years 5 months ago
Managing Uncertainty of XML Schema Matching
Abstract-- Despite of advances in machine learning technologies, a schema matching result between two database schemas (e.g., those derived from COMA++) is likely to be imprecise. ...
Reynold Cheng, Jian Gong, David W. Cheung
AC
2003
Springer
13 years 10 months ago
Generic Haskell: Applications
Generic Haskell is an extension of Haskell that supports the construction of generic programs. These lecture notes discuss three advanced generic programming applications: generic ...
Ralf Hinze, Johan Jeuring