Results 111 to 120 of about 466,712 (258)

Tangent Blow‐Ups for Processing Non‐Manifold Geometry

open access: yesComputer Graphics Forum, EarlyView.
Abstract Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self‐intersections, branching junctions, and other singularities, rendering standard methods ill‐defined at ...
Alice Petrov   +3 more
wiley   +1 more source

Forecasting VARMA processes using VAR models and subspace-based state space models [PDF]

open access: yes
VAR modelling is a frequent technique in econometrics for linear processes. VAR modelling offers some desirable features such as relatively simple procedures for model specification (order selection) and the possibility of obtaining quick non-iterative ...
del Hoyo, Juan   +2 more
core  

Prime subspaces in free topological groups

open access: yesTopology and its Applications, 1995
Let \(F(X)\) \((A(X))\) be the free (Abelian) topological group over \(X\). The authors prove: If \(P\) is one of the spaces \(\mathbb{R}\), \(\mathbb{Q}\), \(\mathbb{R} \setminus \mathbb{Q}\), \(\beta \omega\), \(\beta \omega \setminus \omega\) and \(2^ \kappa\) for an infinite \(\kappa\) and if \(F(X)\) or \(A(X)\) contains a copy of \(P\), then \(X\)
Eda, Katsuya   +2 more
openaire   +1 more source

LORAMI: Low‐Rank Adaptation for Multi‐Identity Physics‐Based Face Rigs

open access: yesComputer Graphics Forum, EarlyView.
Abstract Physics‐based simulation can augment facial rigs with high‐quality deformations, but at steep computational costs. While neural surrogates can substantially reduce computation time, existing methods do not generalize across identity variations and instead require expensive per‐case retraining.
D. Corigliano   +3 more
wiley   +1 more source

Unit Roots and Cointegrating Matrix Estimation using Subspace Methods [PDF]

open access: yes
We propose a new procedure to detect unit roots based on subspace methods. It has three main original features. First, the same method can be applied to single or multiple time series.
José Casals   +2 more
core  

Scott Topology and its Relation to the Alexandroff Topology [PDF]

open access: yes, 2008
In this thesis, we survey the general topological concepts for the Scott topology, one of the fundamental foundations of theoretical computer science.
Al-hanafi, Wael Mohammed
core  

Minimum mean square distance estimation of a subspace [PDF]

open access: yes, 2011
We consider the problem of subspace estimation in a Bayesian setting. Since we are operating in the Grassmann manifold, the usual approach which consists of minimizing the mean square error (MSE) between the true subspace U and its estimate U may not be ...
Jean-Yves Tourneret   +5 more
core   +1 more source

SSILK : Self‐Supervised Integration of Latent Kinematics for Joint‐Driven Neural Garments

open access: yesComputer Graphics Forum, EarlyView.
Abstract Garment animation systems are essential for high‐fidelity digital characters in various applications such as films and video games. We propose SSILK, a neural network‐based method that is explicitly designed to handle loose garments such as capes and robes, garment types that are notoriously hard to simulate via pose‐based garment neural ...
M. Perepichka   +3 more
wiley   +1 more source

Fréchet-Urysohn subspaces of free topological groups, II

open access: yesTopology and its Applications, 2019
The author completes his classification, for metrizable spaces $X$, of when the subspace $F_n(X)$ (of words of length at most $n$) of the free topological group on $X$ is Fréchet-Urysohn. The space $F_2(X)$ is Fréchet-Urysohn [\textit{K. Yamada}, Topol. Proc.
openaire   +3 more sources

Refit Always—Precomputed Ensembles of Bounding Volume Hierarchies for Parametric Animations

open access: yesComputer Graphics Forum, EarlyView.
Abstract Bounding Volume Hierarchies (BVHs) are an integral part of modern real‐time rendering and simulation systems. For animated geometry, however, the runtime cost of rebuilding the BVH every frame to match the deformed geometry is often prohibitive.
Reiner Dolp   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy