3495 search results - page 90 / 699 » On the random satisfiable process |
91
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on n vertices and proceed to remove the ed...
84
Voted
CPC
2006
15 years 24 days ago
2006
For any partition of {1, 2, . . . , n} we define its increments Xi, 1 i n by Xi = 1 if i is the smallest element in the partition block that contains it, Xi = 0 otherwise. We pr...
252
Voted
Book
Markov random field (MRF) theory provides a basis for modeling contextual constraints in visual processing and interpretation. It enables us to develop optimal vision algorithms sy...
107
click to vote
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
Markov Random Field (MRF) models are a popular tool for vision and image processing. Gaussian MRF models are particularly convenient to work with because they can be implemented u...
98
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...