Abstract. Probabilistic tractography provides estimates of the probability of a structural connection between points or regions in a brain volume, based on information from diffusi...
Jonathan D. Clayden, Martin D. King, Chris A. Cl...
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
Flow visualization in 3D is challenging due to perceptual problems such as occlusion, lack of directional cues, lack of depth cues, and visual complexity. In this paper we present...
Let A be a 0 - 1 matrix with precisely two 1's in each column and let 1 be the all-one vector. We show that the problems of deciding whether the linear system Ax 1, x 0 (1)...
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
Philippe Chaput, Vincent Danos, Prakash Panangaden...