2125 search results - page 268 / 425 » On Graph Complexity |
DIALM
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
112
click to vote
ICCS
2004
Springer
15 years 3 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
FORMATS
2006
Springer
15 years 2 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
SCA
2007
15 years 23 days ago
2007
We introduce a framework for advanced behavioral animation in virtual humans, which addresses the challenging open problem of simulating social interactions between pedestrians in...