Abstract Approximate message passing (AMP) algorithms have become an important element of high-dimensional statistical inference, mostly due to their adaptability and concentration properties, the state evolution (SE) equations. This is demonstrated by growing number new iterations proposed for increasingly complex problems, ranging from multi-layer inference low-rank matrix estimation with ela...

In this paper, research is done to examine the usefulness of ’iterations’ in generated referring expressions (that is, using multiple sentences to form a referring expression (with and/or without feedback from the hearer) as an expression instead of one long sentence, without any pause or breaks). Two experiments have been done, one to examine how humans use referring expressions and the second...

The problem of detecting of information and logically independent (DILD) steps in programs is a key for equivalent program transformations. Here we are considering the problem of independence of loop iterations – the concentration of massive data processing and hence the most challenge construction for parallelizing. We introduced a separated form of loops when loop‟s body is a sequence of proc...

The s-step Lanczos method is an attractive alternative to the classical Lanczos method as it enables an O(s) reduction in data movement over a fixed number of iterations. This can significantly improve performance on modern computers. In order for s-step methods to be widely adopted, it is important to better understand their error properties. Although the s-step Lanczos method is equivalent to...

This paper investigates two xpoint approaches for minimal model reasoning with disjunctive logic programs P. The rst one, called model generation 5], is based on an operator T INT P deened on sets of Herbrand interpretations , whose least xpoint is logically equivalent to the set of minimal Herbrand models of the program. The second approach, called state generation 16], uses a xpoint operator ...