1629 search results - page 173 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
92
Voted
IPSN
2009
Springer
15 years 5 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
223
Voted
COCOON
2011
Springer
13 years 10 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
72
Voted
CPAIOR
2006
Springer
15 years 2 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
106
Voted
DAC
2004
ACM
15 years 11 months ago
2004
ACM
Parametric representations used for symbolic simulation of circuits usually use BDDs. After a few steps of symbolic simulation, state set representation is converted from one para...
CIKM
2011
Springer
13 years 10 months ago
2011
Springer
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing ne...