Results 101 to 110 of about 341,424 (240)
FROBENIUS, DIE SCHWEIZ. SCHWEIZ-VERKEHRS-TASCHEN-ATLAS, VERLAG FROBENIUS A.G. BASEL, UNENTBEHRLICH FÜR TOURISTEN, PREIS FR. 2: M2 Frobenius, Die Schweiz. Schweiz-Verkehrs-Taschen-Atlas, Verlag Frobenius A.G. Basel, Unentbehrlich für Touristen, Preis Fr.
Frobenius A.G.
core +1 more source
Predicting Adaptively Chosen Observables in Quantum Systems
PRX QuantumRecent advances have demonstrated that O(logM) measurements suffice to predict M properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the ...
Jerry Huang +3 more
doaj +1 more source
OUGS: Active View Selection via Object‐aware Uncertainty Estimation in 3DGS
Computer Graphics Forum, EarlyView.Abstract Recent advances in 3D Gaussian Splatting (3DGS) have achieved state‐of‐the‐art results for novel view synthesis. However, efficiently capturing high‐fidelity reconstructions of specific objects within complex scenes remains a significant challenge.
Haiyi Li +3 more
wiley +1 more source
, 2014 nag_dsp_norm (f16rdc) calculates the value of the 1-norm, the infinity-norm, the Frobenius norm, or the maximum absolute value of the elements, of a real n by n symmetric matrix, stored in packed ...
Xn X
core
Skeletal‐Driven Animation of Anatomical Humans via Neural Deformation Gradients
Computer Graphics Forum, EarlyView.Abstract Most real‐time animation techniques for digital humans are limited to deforming the outer skin surface. Geometric skinning methods are highly efficient but struggle with artifacts such as collapsing joints or self‐intersections when animating inner anatomy along with the outer skin.
G. Nolte +3 more
wiley +1 more source
Optimal solution of the nearest correlation matrix problem by minimization of the maximum norm [PDF]
The nearest correlation matrix problem is to find a valid (positive semidefinite) correlation matrix, R(m,m), that is nearest to a given invalid (negative semidefinite) or pseudo-correlation matrix, Q(m,m); m larger than 2.
Mishra, SK
core
Differentiable Randers‐Finsler Eikonal Solvers
Computer Graphics Forum, EarlyView.Abstract Fast and differentiable solvers for anisotropic and asymmetric distance fields are a key primitive in geometry processing, enabling gradient‐based optimization over metrics, drift fields, and downstream objectives that depend on geodesic distances and geodesics.
Barak Gahtan +2 more
wiley +1 more source
Phong‐Rodrigues Extrinsic Vector‐Field Processing
Computer Graphics Forum, EarlyView.Abstract We introduce a new extrinsic discretization of tangent vector fields on triangle meshes that is continuous, with bounded derivatives that are continuous almost everywhere, supporting pointwise evaluation and integration of differential operators.
Hongyi Liu +4 more
wiley +1 more source