354 search results - page 48 / 71 » The Chromatic Number Of Graph Powers |
152
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
— In this paper, we examine the impact of application task mapping on the reliability of MPSoC in the presence of single-event upsets (SEUs). We propose a novel soft erroraware d...
138
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
The k-Leaf Root problem is a particular case of graph power problems. Here, we study “error correction” versions of k-Leaf Root—that is, for instance, adding or deleting at m...
150
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
2010
Eurographics
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
191
click to vote
PKDD
2009
Springer
16 years 21 days ago
2009
Springer
We propose a new, recursive model to generate realistic graphs, evolving over time. Our model has the following properties: it is (a) flexible, capable of generating the cross pro...
166
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...