Results 151 to 160 of about 1,420,165 (213)

On the asymmetry, complexity and predicted data patterns of nontraditional item response theory models

open access: yesBritish Journal of Mathematical and Statistical Psychology, EarlyView.
Abstract Traditional item response theory (IRT) models involve symmetric response probability functions, but a developing area of research has focused on asymmetric alternatives. To date, these studies have focused primarily on introducing new asymmetric models, detailing their mathematical formulations, explaining how to interpret their item ...
Hyejin Shim, Wes Bonifay
wiley   +1 more source

Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities

open access: yesComputer Graphics Forum, EarlyView.
Abstract Estimating correspondences between deformed shape instances is a long‐standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling, rely on recovering an accurate correspondence map. Many methods have thus been proposed to tackle this challenging problem from varying perspectives, depending on ...
A. Zhuravlev   +14 more
wiley   +1 more source

Register‐Efficient Linear‐Time Evaluation in the Bernstein Basis

open access: yesComputer Graphics Forum, EarlyView.
Abstract We investigate the evaluation of points and derivatives of Bézier curves and surfaces on modern architectures, focusing on performance and guided by numerical error bounds. While the de Casteljau algorithm remains the reference for numerical robustness, its linear working‐set size imposes substantial register pressure on GPUs.
Gábor Valasek, Anna Lili Horváth
wiley   +1 more source

Establishing Shape Correspondences: A Survey

open access: yesComputer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source

Noisy Graph Patterns via Ordered Matrices

open access: yesComputer Graphics Forum, EarlyView.
Abstract The high‐level structure of a graph is a crucial ingredient for the analysis and visualization of relational data. However, discovering the salient graph patterns that form this structure is notoriously difficult for two reasons. (1) Finding important patterns, such as cliques and bicliques, is computationally hard.
J. Wulms, W. Meulemans, B. Speckmann
wiley   +1 more source

Home - About - Disclaimer - Privacy