22 search results - page 4 / 5 » Ramsey properties of random discrete structures |
ICPR
2006
IEEE
14 years 7 months ago
2006
IEEE
This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kern...
IPMI
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. Non-rigid image registration is a challenging task in medical image analysis. In recent years, there are two essential issues. First, intensity similarity is not necessar...
ECCV
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
RSA
2010
13 years 4 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present the discrete beeping communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. S...