Article: Data from Technical University of Denmark advance knowledge in information technology.

"In Pickard random fields (PRF), the probabilities of finite configurations and the entropy of the field can be calculated explicitly, but only very simple structures can be incorporated into such a field. Given two Markov chains describing a boundary, an algorithm is presented which determines whether a PRF consistent with the distribution on the boundary and a 2-D constraint exists," scientists in Lyngby, Denmark report.

"Iterative scaling is used as part of the algorithm, which also determines the conditional probabilities yielding the maximum entropy for the given boundary description if a solution exists. A PRF is defined for the domino tiling constraint ...

Related newspaper, magazine, and journal articles:

 
 
Newsweek Harper's Magazine The Washington Post Chicago Tribune Crain's Chicago Business PRNewswire Pediatric News The Nation Advertising Age The Economist (US) A FREE trial gives you access to over 80 million articles! Access over 6,500 publications with a FREE trial!