Results 61 to 70 of about 188 (174)
Latent Poisson count models for action count data from technology‐enhanced assessments
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract Recent advances in computerized assessments have enabled the use of innovative item formats (e.g., drag‐and‐drop, scenario‐based), necessitating a flexible model that can capture systematic influence of item types on action counts. In this study, we present a refinement scheme that can explicitly model common features of items and allows ...
Gregory Arbet, Hyeon‐Ah Kang
wiley +1 more source
Statistical Mechanics and Thermodynamics: Boltzmann's versus Planck's State Definitions and Counting †. [PDF]
Entropy (Basel), 2021 Enders P.
europepmc +1 more source
A Survey of Methods for Constructing 3D Urban Models From Point Clouds
Computer Graphics Forum, EarlyView.The survey outlines a general process for constructing 3D models from point clouds and categorizes the methods based on their use of templates, basic surface primitives, hybrid approaches, or linear primitives. Additionally, the survey reviews the datasets and benchmarks that are essential for testing and training the developed methods.
Chiara Romanengo +5 more
wiley +1 more source
Embedding channel pruning within the CNN architecture design using a bi-level evolutionary approach. [PDF]
J Supercomput, 2023 Louati H, Louati A, Bechikh S, Kariri E.
europepmc +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
Establishing Shape Correspondences: A Survey
Computer 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
Embedding Optimization of Layouts via Distortion Minimization
Computer Graphics Forum, EarlyView.Abstract Given an embedding of a layout in the surface of a target mesh, we consider the problem of optimizing the embedding geometrically. Layout embeddings partition the surface into multiple disk‐like patches, making them particularly useful for parametrization and remeshing tasks, such as quad‐remeshing, since these problems can then be solved on ...
A. Heuschling, I. Lim, L. Kobbelt
wiley +1 more source
ReTrace: Interactive Visualizations for Reasoning Traces of Large Reasoning Models
Computer Graphics Forum, EarlyView.Abstract Recent advances in Large Language Models have led to Large Reasoning Models, which produce step‐by‐step reasoning traces. Such traces may offer insight into how models think, improving explainability and clarifying the underlying process. These traces, however, are often verbose and complex, making them cognitively demanding to comprehend ...
L. Felder +4 more
wiley +1 more source
A Simple Grid‐Maps Pipeline: Restructured, Accelerated and Upgraded
Computer Graphics Forum, EarlyView.Abstract Grid maps – spatially arranged small multiples – are a powerful tool to show complex geospatial data. Meulemans et al. (2020) introduced a pipeline for computing high‐quality grid maps that are shaped roughly according to their containing geographic outlines.
W. Meulemans
wiley +1 more source