592 search results - page 38 / 119 » Crossing numbers of random graphs |
LREC
2010
13 years 9 months ago
2010
Determining semantic relatedness between words or concepts is a fundamental process to many Natural Language Processing applications. Approaches for this task typically make use o...
CISS
2007
IEEE
14 years 2 months ago
2007
IEEE
— In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Oc...
CN
2010
13 years 4 months ago
2010
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...