By modifying the intensity of the motivations to test the adaptability of our model of action selection in real-time, we provide evidence of a relationship between motivations and personality traits. These modifications imply a tendency to satisfy more or less some motivations and give to the virtual human distinctiveness in its behaviors. By defining specific set of motivation intensity, we ca...

Stereo matching is the key step in estimating depth from two or more images. Recently, some tree-based non-local stereo matching methods [22, 12] have been proposed, which achieved state-of-the-art performance. The algorithms employed some tree-structures to aggregate cost and thus improved the performance and reduced the coputation load of the stereo matching. However, the computational comple...

In this paper, we continue the study of Lebesgue-type inequalities for greedy algorithms. We introduce notion strong partially Markushevich bases and parameters associated with them. prove that property is equivalent to being conservative quasi-greedy, extending a similar result given in Dilworth et al. (Constr Approx 19:575–597, 2003) Schauder bases. also give characterization 1-strong partial...

5 Regular expressions with capture groups offer a concise and natural way to define parse trees over the text that they are parsing, however classical algorithms only return a single match for each capture group, not the full parse tree. We describe an algorithm based on finite-state automata that extracts full parse trees from text in Θ(nm) time and Θ(dn+m) space (where n is the size of the te...

max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the para...