Results 111 to 120 of about 113,518 (248)
Enhancing generalized spectral clustering with embedding Laplacian graph regularization
Abstract An enhanced generalised spectral clustering framework that addresses the limitations of existing methods by incorporating the Laplacian graph and group effect into a regularisation term is presented. By doing so, the framework significantly enhances discrimination power and proves highly effective in handling noisy data.
Hengmin Zhang +5 more
wiley +1 more source
A Quantised Push‐Sum Distributed Adaptive Momentum Algorithm for Optimisation Over Directed Networks
ABSTRACT In this paper, we investigate a distributed constrained optimisation problem over directed networks. The agents in the networks conduct local computations and communications, endeavouring to collaboratively minimise the aggregation of all locally known convex cost functions subject to a global constraint set.
Qingguo Lü +6 more
wiley +1 more source
Abstract Much of the current popular and academic literature on the provision of green spaces is dominated by the assumption that ‘nature’ is an unalloyed positive, and that socioeconomic and racial exclusion from access to green spaces is a problem of unequal spatial distribution rather than of the form and content of particular urban designs.
Kiera Chapman
wiley +1 more source
Adaptive Optical Layers: Efficient Tall Cell Grids for Liquid Simulation
Abstract Tall cell grids have been proposed as an efficient approach to accelerate large‐scale liquid simulation. In this framework, regions near the liquid surface are discretized with regular grids, while regions farther away are represented by elongated rectangular cells.
Fumiya Narita, Takashi Kanai
wiley +1 more source
In this paper, we consider the nonconvex extended trust-region subproblem with two intersecting linear inequality constraints, $(\mathrm{ETR}_2)$, and use a sequence of semi-definite programming (SDP) problems with second-order-cone(SOC) constraints to ...
Wang, Meiling
doaj +1 more source
Non‐Rigid 3D Shape Correspondences: From Foundations to Open Challenges and Opportunities
Abstract Estimating correspondences between deformed shape instances is a long‐standing problem in computer graphics; numerous applications, from texture transfer to statistical modelling, rely on recovering an accurate correspondence map. Many methods have thus been proposed to tackle this challenging problem from varying perspectives, depending on ...
A. Zhuravlev +14 more
wiley +1 more source
This research deals with the economic-environmental dispatch problem (EEDP) in multi-terminal high-voltage direct-current (MT-HVDC) systems by proposing a convex approximation based on semi-definite programming (SDP).
Wilmar Contreras-Sepúlveda +2 more
doaj +1 more source
Hierarchical Optimization of the As‐Rigid‐As‐Possible Energy
Abstract The As‐Rigid‐As‐Possible (ARAP) energy [SA07] has become a versatile ingredient in various geometry processing and machine learning methods. The classic method for its minimization is a block coordinate descent, alternating between local rotation estimation and a global linear solve, which converges slowly for large problem instances.
Hendrik Meyer, Bernd Bickel, Marc Alexa
wiley +1 more source
Overview of participant and healthcare professional experiences in the STEADY process evaluation. Key themes highlight the importance of an integrated and multidisciplinary approach to type 1 diabetes and disordered eating, positive therapeutic relationship, and flexible person‐centred care.
Natalie Zaremba +11 more
wiley +1 more source
In this study, a controller law is investigated using a quarter-car model to ensure that a performance measure expressing passenger comfort has the lowest value. In this controller law, kinematic and dynamic inequalities associated with the state vector
Can U. DOĞRUER
doaj

