Results 131 to 140 of about 214,297 (361)
On the space of null geodesics of a spacetime: the compact case, Engel geometry and retrievability [PDF]
Adrià Marín-Salvador, Roberto Rubio
openalex +1 more source
A tutorial on Bayesian model averaging for exponential random graph models
Abstract The use of exponential random graph models (ERGMs) is becoming prevalent in psychology due to their ability to explain and predict the formation of edges between vertices in a network. Valid inference with ERGMs requires correctly specifying endogenous and exogenous effects as network statistics, guided by theory, to represent the network ...
Ihnwhi Heo +2 more
wiley +1 more source
SDFs from Unoriented Point Clouds using Neural Variational Heat Distances
We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from unoriented point clouds. We first compute a small time step of heat flow (middle) and then use its gradient directions to solve for a neural SDF (right). Abstract We propose a novel variational approach for computing neural Signed Distance Fields (SDF) from ...
Samuel Weidemaier +5 more
wiley +1 more source
Geodesic flow kernel for unsupervised domain adaptation
Boqing Gong +3 more
semanticscholar +1 more source
Geodesic planes in geometrically finite manifolds-corrigendum
Osama Khalil
openalex +1 more source
Controllable Intrinsic Surface Pattern Generation Using Slime Mold Simulations
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
POSSIBILITIES OF MODERN ELECTRONIC GEODESIC EQUIPMENT AND TRENDS OF ITS DEVELOPMENT
Maksym Kukhar +3 more
openalex +2 more sources
Mesh Processing Non‐Meshes via Neural Displacement Fields
Abstract Mesh processing pipelines are mature, but adapting them to newer non‐mesh surface representations—which enable fast rendering with compact file size—requires costly meshing or transmitting bulky meshes, negating their core benefits for streaming applications.
Yuta Noma +4 more
wiley +1 more source
THE UPPER OPEN GEODETIC NUMBER OF A GRAPH [PDF]
For a connected graph G of ordern, a set S of vertices of G is a geodetic set of G ifeach vertex n of G lies on a x-y geodesic for someelements x and y in S.
A. P. Santhakumaran, T. Kumari Latha
doaj

