202 search results - page 10 / 41 » Locally identifying coloring of graphs |
117
click to vote
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
IPL
2000
14 years 11 months ago
2000
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
68
Voted
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a novel unsupervised color segmentation scheme named ROI-SEG, which is based on the main idea of combining a set of different sub-segmentation results. We prop...
116
click to vote
DC
2010
14 years 11 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
110
click to vote
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— We consider the problem of link scheduling in a sensor network employing a TDMA MAC protocol. Our link scheduling algorithm involves two phases. In the first phase, we assign ...