Results 191 to 200 of about 2,419,433 (298)

LLM‐based prior elicitation for Bayesian graphical modeling

open access: yesBritish Journal of Mathematical and Statistical Psychology, EarlyView.
ABSTRACT In the Bayesian graphical modeling framework, priors on network structure encode theoretical assumptions and uncertainty about the topology of psychological constructs under study. For instance, the Bernoulli prior specifies the probability of each pairwise interaction, the Beta–Bernoulli prior governs expected network density, and the ...
Nikola Sekulovski   +2 more
wiley   +1 more source

Fused Collapsing for Wide BVH Construction

open access: yesComputer Graphics Forum, EarlyView.
Abstract We propose a novel approach for constructing wide bounding volume hierarchies on the GPU by integrating a simple bottom‐up collapsing procedure within an existing binary bottom‐up BVH builder. Our approach directly constructs a wide BVH without traversing a temporary binary BVH as done by previous approaches and achieves 1.4 – 1.6 × lower ...
Wilhem Barbier, Mathias Paulin
wiley   +1 more source

FluidMap: Proportional and Spatially Consistent Layout Enrichments in Multidimensional Projections

open access: yesComputer Graphics Forum, EarlyView.
FluidMap faithfully represents the frequency of an attribute and preserves spatial consistency. Current space‐filling methods over‐ or under‐represent attribute categories (i.e., all Voronoi‐based methods), sacrifice spatial consistency (i.e., Nmap) or both (i.e., Voronoi‐MWα).
Daniela Blumberg   +5 more
wiley   +1 more source

Controllable Intrinsic Surface Pattern Generation Using Slime Mold Simulations

open access: yesComputer Graphics Forum, EarlyView.
Abstract Surface‐based pattern simulations have proven valuable for texture design and scientific visualization, but existing methods face several limitations. Most simulations either target a narrow range of pattern types (e.g. spots, branching) or support a broad range of patterns at the cost of time‐consuming parameter tuning.
Jeffrey Layton   +2 more
wiley   +1 more source

Contouring Signed Distance Fields by Approximating Gradients

open access: yesComputer Graphics Forum, EarlyView.
Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley   +1 more source

Home - About - Disclaimer - Privacy