74 search results - page 15 / 15 » New length bounds for cycle bases |
ALT
2011
Springer
12 years 5 months ago
2011
Springer
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
HPCA
2009
IEEE
14 years 5 months ago
2009
IEEE
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
AI
2008
Springer
13 years 5 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...