970 search results - page 139 / 194 » On encodings of spanning trees |
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
The structure of a Bayesian network (BN) encodes variable independence. Learning the structure of a BN, however, is typically of high computational complexity. In this paper, we e...
BTW
2007
Springer
15 years 1 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
WSCG
2004
14 years 11 months ago
2004
This paper proposes an embedded rate scalable wavelet-based image coding algorithm. We introduce a simple and efficient approach for coding the positions and the signs of the wave...
ISDA
2010
IEEE
14 years 7 months ago
2010
IEEE
Statistically-based parsers for large corpora, in particular the Penn Tree Bank (PTB), typically have not used all the linguistic information encoded in the annotated trees on whic...
CIKM
2007
Springer
15 years 4 months ago
2007
Springer
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...