1357 search results - page 182 / 272 » Compositionality in Graph Transformation |
164
click to vote
JSW
2008
15 years 3 months ago
2008
Automatic discovery of semantic relations between resources is a key issue in Web-based intelligent applications such as document understanding and Web services. This paper explore...
148
click to vote
ECCC
2010
15 years 2 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
161
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
In Artificial Intelligence with Coalition Structure Generation (CSG) one refers to those cooperative complex problems that require to find an optimal partition, maximising a soci...
132
Voted
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
The use of statically compiled search networks for ASR systems using huge vocabularies and complex language models often becomes challenging in terms of memory requirements. Dynam...
139
click to vote
ICDCS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...