60 search results - page 10 / 12 » On Packing Colorings of Distance Graphs |
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
The performance of graph based clustering methods critically depends on the quality of the distance function, used to compute similarities between pairs of neighboring nodes. In t...
ALGOSENSORS
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
FSTTCS
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
JGT
2006
13 years 7 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...