370 search results - page 54 / 74 » Computational Study on Dominating Set Problem of Planar Grap... |
STOC
2002
ACM
15 years 12 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
108
Voted
PODC
2006
ACM
15 years 5 months ago
2006
ACM
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
104
Voted
SOSP
2009
ACM
15 years 8 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Systematic content screening of cell phenotypes in microscopic images has been shown promising in gene function understanding and drug design. However, manual annotation of cells ...
100
Voted
SIBGRAPI
2008
IEEE
15 years 6 months ago
2008
IEEE
2D electrophoresis is a well known method for protein separation which is extremely useful in the field of proteomics. Each spot in the image represents a protein accumulation an...