131 search results - page 22 / 27 » Colouring Random Regular Graphs |
SODA
2007
ACM
13 years 9 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Many feature detection algorithms rely on the choice of scale. In this paper, we complement standard scaleselection algorithms with spatial regularization. To this end, we formula...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
IJWMC
2010
13 years 4 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
CPC
2006
13 years 7 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...