1153 search results - page 186 / 231 » Reversing graph transformations |
141
Voted
CALCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
106
Voted
CSR
2009
Springer
15 years 10 months ago
2009
Springer
Muchnik’s theorem about simple conditional descriptions states that for all strings a and b there exists a short program p transforming a to b that has the least possible length ...
135
Voted
SEMCO
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper describes work on Named Entity Recognition (NER), in preparation for Relation Extraction (RE), on data from a historical archive organisation. As is often the case in t...
121
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Region-based memory management is a form of compiletime memory management, well-known from the functional programming world. This paper describes a static region analysis...
128
Voted
SEMWEB
2007
Springer
15 years 9 months ago
2007
Springer
This paper describes SODA a novel ontology alignment method for the OWL-DL format. SODA uses a new approach that consists in computing local and semantic similarities among ontolog...