1542 search results - page 139 / 309 » The metamathematics of random graphs |
116
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
110
click to vote
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
147
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
120
click to vote
IJSI
2008
15 years 1 months ago
2008
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
144
click to vote
ECCV
2008
Springer
16 years 7 days ago
2008
Springer
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...