Results 91 to 100 of about 5,171,937 (249)
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The k $k$‐winners‐take‐all (k $k$WTA) problem, as a competitive selection strategy, is crucial in multi‐agent systems. However, existing noise‐robust k $k$WTA networks mainly address noise while overlooking communication disturbances. The coexistence of both factors significantly degrades solution accuracy and hinders distributed consensus ...
Jiexing Li, Shuai Li
wiley +1 more source
The oscillation of separately locally Lipschitz functions
Karpatsʹkì Matematičnì Publìkacìï, 2013 We prove that a function which dened on the product of two metric Baire spaces is the oscillation of some separately locally Lipschitz function if and only if it is an upper semicontinuous non-negative function which has a crosswise nowhere dense closure
V. H. Herasymchuk, O. V. Maslyuchenko
doaj +1 more source
Bursting Oscillation Characteristics and Improved AHODFC for DFIG and PMSG Combined Wind Farm
Energy Internet, EarlyView.ABSTRACT Bursting oscillations occur in DFIG and PMSG combined wind farm under external disturbances and lead to the instability problems. To reveal the bursting oscillation characteristics and develop a suppression method, a fast‐slow dynamics analysis method and an improved adaptive high‐order differential feedback controller (AHODFC) based on ...
Kun Wang +3 more
wiley +1 more source
SDFs from Unoriented Point Clouds using Neural Variational Heat Distances
Computer Graphics Forum, EarlyView.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
MathematicsIn this paper, we present sufficient conditions for Hyers-Ulam-Rassias stability of nonlinear implicit higher-order Volterra-type integrodifferential equations from above on unbounded time scales.
Andrejs Reinfelds, Shraddha Christian
doaj +1 more source
Medial Axis Aware Learning of Signed Distance Functions
Computer Graphics Forum, EarlyView.Abstract We propose a novel variational method to compute a highly accurate global signed distance function (SDF) to a given point cloud. To this end, the jump set of the gradient of the SDF, which coincides with the medial axis of the surface, is explicitly taken into account through a higher‐order variational formulation that enforces linear growth ...
Samuel Weidemaier +2 more
wiley +1 more source
Progressive Convex Hull Simplification
Computer Graphics Forum, EarlyView.Abstract Convex hulls are useful as tight bounding proxies for a variety of tasks including collision detection, ray intersection, and distance computation. Unfortunately, the complexity of polyhedral convex hulls grows linearly with their input. We consider the problem of conservatively simplifying a convex hull to a specified number of half‐spaces ...
Alec Jacobson
wiley +1 more source
Two applications of the Theory of Currents [PDF]
, 2013 In the first part of the thesis we find an adapted version of the Rademacher theorem of differentiability of Lipschitz functions, when the Lebesgue measure on the euclidean space is replaced by a generical Radon measure.
MARCHESE, ANDREA
core
Compactly supported detail field for high quality neural implicit surfaces
Computer Graphics Forum, EarlyView.Abstract Neural implicit surfaces are a powerful tool for encoding a surface as the zero level set of a neural function. Trained using gradient‐descent based optimizers, these methods however suffer from a low‐frequency bias that prevents them to fit fine details of the surface.
Guillaume Coiffier, Justine Basselin
wiley +1 more source
Tangent Blow‐Ups for Processing Non‐Manifold Geometry
Computer 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