Results 121 to 130 of about 121,870 (266)
Multi-label feature selection based on dynamic graph Laplacian
Tongxin xuebao, 2020 In view of the problems that graph-based multi-label feature selection methods ignore the dynamic change of graph Laplacian matrix, as well as such methods employ logical-value labels to guide feature selection process and loses label information, a ...
Yonghao LI +3 more
doaj +2 more sources
American Journal of Political Science, EarlyView.Abstract How can defense alliances reap the efficiency gains of working together when coordination and opportunism costs are high? Although specializing as part of a collective comes with economic and functional benefits, states must bargain over the distribution of those gains and ensure the costs of collective action are minimized.
J. Andrés Gannon
wiley +1 more source
Correction to: Robust joint clustering of multi-omics single-cell data via multi-modal high-order neighborhood Laplacian matrix optimization. [PDF]
Bioinformatics, 2023 europepmc +1 more source
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
Democratising Multi‐Projector Displays
Computer Graphics Forum, EarlyView.Spatially augmented reality (SAR) transforms large, surround, collaborative experiences out of VR/AR headsets to the real world by merging content from projectors with the physical environment. This detailed state‐of‐the‐art survey reports on the advancements in multi‐projector aggregation and hardware technologies used to achieve SAR and build ...
Aditi Majumder, Muhammad Twaha Ibrahim
wiley +1 more source
Real‐Time Conformal Maps and Parameterizations
Computer Graphics Forum, EarlyView.Abstract We present a simple algorithm to conformally map between two simple and bounded planar domains based on the concept of harmonic measure, which is a conformal invariant. With suitable preprocessing, the algorithm is fast enough to compute all possible conformal maps (having three real degrees of freedom) between the two domains in real time in
Q. Chang, C. Gotsman, K. Hormann
wiley +1 more source
On the neighbourhood degree sum-based Laplacian energy of graphs
Kuwait Journal of ScienceA useful extension of the Laplacian matrix is proposed here and the corresponding modification of the Laplacian energy (LE) is presented. The neighbourhood degree sum-based Laplacian energy (LNE) is produced by means of the eigenvalues of the newly ...
doaj +1 more source
The Laplacian matrix of weighted threshold graphs
The Electronic Journal of Linear AlgebraThreshold graphs are generated from one node by repeatedly adding a node that links to all existing nodes or adding a node without links. In the weighted threshold graph, we add a new node in step $i$, which is linked to all existing nodes by a link of weight $w_i$.
Yingyue Ke +2 more
openaire +4 more sources
3D Character Reconstruction from Hand‐drawn Model Sheets
Computer Graphics Forum, EarlyView.Abstract Hand‐drawn model sheets are widely used in character design to define 3D shape and appearance through sparse multi‐view drawings. Reconstructing 3D characters from such sparse inputs has traditionally been challenging due to insufficient visual information.
Hyejeong Yoon +3 more
wiley +1 more source
Controllable Intrinsic Surface Pattern Generation Using Slime Mold Simulations
Computer Graphics Forum, EarlyView.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