Results 41 to 50 of about 277 (163)
Computing Skinning Weights via Convex Duality
Computer Graphics Forum, EarlyView.We present an alternate optimization method to compute bounded biharmonic skinning weights. Our method relies on a dual formulation, which can be optimized with a nonnegative linear least squares setup. Abstract We study the problem of optimising for skinning weights through the lens of convex duality.
J. Solomon, O. Stein
wiley +1 more source
On the factorization invariants of arithmetical congruence monoids
, 2023 In this paper, we study various factorization invariants of arithmetical congruence monoids. The invariants we investigate are the catenary degree, a measure of the maximum distance between any two factorizations of the same element, the length density ...
Zhang, Andrew +3 more
core
Efficient Constrained Tensor Factorization by Alternating Optimization with Primal-Dual Splitting [PDF]
2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2018 5 pages, submitted to ...
Shunsuke Ono, Takuma Kasai
openaire +2 more sources
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
Primal-dual algorithms for non-negative matrix factorization with the Kullback-Leibler divergence [PDF]
2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2017 Non-negative matrix factorization (NMF) approximates a given matrix as a product of two non-negative matrices. Multiplicative algorithms deliver reliable results, but they show slow convergence for high-dimensional data and may be stuck away from local minima.
Felipe Yanez, Francis R. Bach
openaire +2 more sources
Contouring Signed Distance Fields by Approximating Gradients
Computer Graphics Forum, EarlyView.Abstract Signed distance fields are often represented by discrete samples (e.g., on a grid). Recovering the contour implicitly represented by the distance samples requires an approximation algorithm. Several recent approaches have shown that exploiting the information carried in each distance sample by explicitly constructing a surface point gives ...
M. Kohlbrenner, M. Alexa
wiley +1 more source
Novel methods for primality testing and factoring
, 2005 From the time of the Greeks, primality testing and factoring have fascinated mathematicians, and for centuries following the Greeks primality testing and factorization were pursued by enthusiasts and professional mathematicians for their intrisic ...
Hammad, Yousef Bani
core
Primality Tests And Algorithms For Factoring Integers
, 2014 σ.Στην παρούσα εργασία , θα παρουσιασθούν μέθοδοι πιστοποίησης πρώτων αριθμών και αλγόριθμοι παραγοντοποίησης ακεραίων. Ξεκινώντας από τις κλασσικές μεθόδους , στο πρώτο κεφάλαιο παραθέτονται η μέθοδος των διαδοχικών διαιρέσεων , το κόσκινο του ...
Laiou, Erofili P. +1 more
core +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
Primality Testing, Integer Factorization, and Discrete Logarithms
, 1998 this paper is to survey some historical and modern methods for primality testing, integer factorization, and the discrete logarithm problem, and point out some theoretical questions related to the algorithms.
Theodoulos Garefalakis
core