Results 161 to 170 of about 18,314 (299)
The Laplacian Spread of a Tree
Discrete Mathematics & Theoretical Computer Science, 2008 The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph.
Yi-Zheng Fan +3 more
doaj
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Accurately predicting line loss rates is crucial for effective management in distribution networks, particularly for short‐term multihorizon forecasts ranging from 1 hour to 1 week. In this study, we propose attention‐GCN–LSTM, a novel method that integrates graph convolutional networks (GCN), long short‐term memory (LSTM) and a three‐level ...
Jie Liu +4 more
wiley +1 more source
On the Laplacian and signless Laplacian spectra of complete multipartite graphs [PDF]
, 2017 Let G be a finite simple graph with vertex set V(G) = {v1, v2, v3, …, vn} and edge set E(G). The adjacency matrix of G is an (nn)-matrix A(G) = [aij] where aij = 1 if vivj E(G) and aij = 0 elsewhere, and the degree matrix of G is a diagonal (nn)-matrix ...
Ikawati, Deasy Sandhya Elya +2 more
core
ANPGT: Towards Adaptive Node Property Extraction and Integration
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT Graph transformers (GTs) with elaborate positional/structural encodings (PEs/SEs) have excelled in graph representation learning, especially in graph‐level tasks. However, their potential in large‐scale node classification remains untapped for several reasons: (i) Current PEs/SEs are insufficient in modelling large‐scale real‐world graphs ...
Qin Chen +4 more
wiley +1 more source
Distributed k‐WTA Network for Multi‐Manipulator Competition With Experimental Verifications
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT In this article, a new distributed k $k$‐winner‐take‐all (Dk $k$‐WTA) network is designed and used to construct a dynamic allocation scheme for competitive coordination tasks of multiple manipulators as embodied agents. The scheme is constructed based on the following two aspects. On one hand, with reference to a perspective that the Laplacian
Shengkai Sun, Yutong Li, Jianfeng Lv
wiley +1 more source
Real Estate Economics, EarlyView.Abstract We estimate the price impact of very nearby concurrently listed properties in the Sydney housing market and assess their competition effects. We apply a hedonic model with spatiotemporal effects regularized via a graph Laplacian prior at the month‐by‐SA2 regional level to seven SA4 subregions of metropolitan Sydney. The model structure enables
Willem P. Sijp, Mengheng Li
wiley +1 more source
Graph‐Laplacian modeling of spatiotemporal effects for house price estimation
Real Estate Economics, EarlyView.Abstract Many variables involve the modeling of spatial effects, and their dynamics over time. This article presents a linear model in which spatiotemporal random effects are modeled by graph‐Laplacians. A graph‐Laplacian flexibly encodes adjacency in both space and time, in our case not depending on unknown parameters. The graph‐Laplacian can be input
Willem P Sijp, Marc K. Francke
wiley +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