820 search results - page 52 / 164 » Inducing Temporal Graphs |
CORR
2011
Springer
13 years 5 months ago
2011
Springer
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
DAIS
2011
13 years 2 months ago
2011
Abstract. Dealing with Network Address Translators (NATs) is a central problem in many peer-to-peer applications on the Internet today. However, most analytical models of overlay n...
INFOCOM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Space-time communications can help combat fading and hence can significantly increase the capacity of ad hoc networks. Cooperative diversity or virtual antenna arrays facilita...
ESA
2006
Springer
14 years 2 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
We present an algorithm, HI-MAT (Hierarchy Induction via Models And Trajectories), that discovers MAXQ task hierarchies by applying dynamic Bayesian network models to a successful...