1550 search results - page 215 / 310 » Benchmarking for Graph Transformation |
119
Voted
CALCO
2009
Springer
15 years 7 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...
81
Voted
CSR
2009
Springer
15 years 7 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 ...
108
Voted
SEMCO
2007
IEEE
15 years 7 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...
106
Voted
SEMWEB
2007
Springer
15 years 6 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...
107
Voted
ICMCS
2006
IEEE
15 years 6 months ago
2006
IEEE
We present a system and a set of tools for producing special effects in film/video making by applying image processing and human centered computing techniques. A combination of s...