Sciweavers

187 search results - page 11 / 38
» Labeling Schemes for Tree Representation
Sort
View
QEST
2008
IEEE
14 years 2 months ago
Hintikka Games for PCTL on Labeled Markov Chains
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
Harald Fecher, Michael Huth, Nir Piterman, Daniel ...
WCRE
2000
IEEE
14 years 6 days ago
Towards Portable Source Code Representations using XML
One of the most important issue in source code analysis and software re-engineering is the representation of ode text at an abstraction level and form suitable for algorithmic pro...
Evan Mamas, Kostas Kontogiannis
AIMSA
2006
Springer
13 years 11 months ago
A Proposal for Annotation, Semantic Similarity and Classification of Textual Documents
Abstract. In this paper, we present an approach for classifying documents based on the notion of a semantic similarity and the effective representation of the content of the docume...
Emmanuel Nauer, Amedeo Napoli
ML
2010
ACM
210views Machine Learning» more  ML 2010»
13 years 6 months ago
Mining frequent closed rooted trees
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
José L. Balcázar, Albert Bifet, Anto...
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
13 years 7 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer