Coherent Mark-based Stylization of 3D Scenes at the Compositing Stage

But for finite depth foliations (which have two sided branching), there are many examples where it is impossible to make the pseudo-Anosov flow transverse to the foliation [Mo5] and

Let X be a n-dimensional compact Alexandrov space satisfying the Perel’man conjecture. Let X be a compact n-dimensional Alexan- drov space of curvature bounded from below by

of Witten’s parameter in his phase transition between Calabi-Yau and Landau- Ginzburg theories; or in the setting of this paper, between GW invariants of stable maps with p-fields

Making a choice among designs from late Safavid blue and white ceramics is a difficult task yet two special designs stand out which recall well known Kangxi patterns from the turn

First, while the mipmap mechanism addresses the texture compression due to minification (zooming out), it produces simple linear blending for texture mag- nification (zooming in).

In these applications, the probability measures that are involved are replaced by uniform probability measures on discrete point sets, and we use our algorithm to solve the

The “Live@Knowledge 5.0” computer program will be presented to all those people who shared their data and knowledge to build knowledge needed to solve historical problems.. It is

That leaves two things we can do to bring dark data to light: one, change the incentives involved in research to better reflect the value of negative or in- conclusive research