712 search results - page 36 / 143 » A mixture model for random graphs |
APPROX
2008
Springer
14 years 8 days ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
A d-regular graph has largest or first (adjacency matrix) eigenvalue 1 = d. Consider for an even d 4, a random d-regular graph model formed from d/2 uniform, independent permutat...
ICPR
2008
IEEE
14 years 4 months ago
2008
IEEE
In patch based face super-resolution method, the patch size is usually very small, and neighbor patches’ relationship via overlapped regions is only to keep smoothness of recons...
TCOM
2010
13 years 8 months ago
2010
Abstract—This paper considers an uplink time division multiple access (TDMA) cognitive radio network where multiple cognitive radios (secondary users) attempt to access a spect...
NAACL
2007
13 years 11 months ago
2007
A novel random text generation model is introduced. Unlike in previous random text models, that mainly aim at producing a Zipfian distribution of word frequencies, our model also ...