202 search results - page 12 / 41 » Locally identifying coloring of graphs |
124
click to vote
FSTTCS
2004
Springer
15 years 5 months 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...
PR
2006
14 years 11 months ago
2006
In this paper a completely automatic face recognition system is presented. The method works on color images: after having localized the face and the facial features, it determines...
DISOPT
2010
14 years 11 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
139
click to vote
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...
102
click to vote
PODC
2010
ACM
15 years 3 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...