Results 41 to 50 of about 24,126 (306)

Regular factors in regular graphs

open access: yesDiscrete Mathematics, 1993
The author shows that a \(k\)-regular \((k-1)\)-edge-connected graph with an even number of vertices has an \(m\)-factor not containing \(k-m\) arbitrarily prescribed edges whenever \(1\leq m\leq k-1\). This was known only for \(m=1\) or \(k-1\). Also the sharpness of this result and some corollaries are given.
openaire   +2 more sources

Active Learning‐Accelerated Discovery of Fibrous Hydrogels with Tissue‐Mimetic Viscoelasticity

open access: yesAdvanced Functional Materials, EarlyView.
Active learning accelerates the design of fibrous hydrogels that mimic the viscoelasticity of native tissues. By integrating multi‐objective optimization and closed‐loop experimentation, this approach efficiently identifies optimal formulations from thousands of possibilities and decouples elasticity and viscosity. The resulting hydrogels offer tunable
Zhengkun Chen   +11 more
wiley   +1 more source

Spectral Geometry for Structural Pattern Recognition [PDF]

open access: yes, 2010
Graphs are used pervasively in computer science as representations of data with a network or relational structure, where the graph structure provides a flexible representation such that there is no fixed dimensionality for objects. However, the analysis
El Ghawalby, Heyayda   +1 more
core  

Inverse Design of Amorphous Materials With Targeted Properties

open access: yesAdvanced Materials, EarlyView.
AMDEN is a diffusion model framework for the inverse design of amorphous materials with targeted properties. By incorporating Hamiltonian Monte Carlo refinement into the denoising process, the framework overcomes the challenge of generating thermally relaxed disordered structures.
Jonas A. Finkler   +4 more
wiley   +1 more source

Regular $K_3$-regular graphs

open access: yesCoRR
We study graphs that are simultaneously regular with respect to the ordinary vertex degree and regular with respect to the triangle degree, that is, the number of triangles containing a given vertex. We call such graphs regular $K_3$-regular. We investigate the (non-)existence of regular $K_3$-regular graphs with prescribed parameters $(r_2,r_3 ...
Artem Hak   +3 more
openaire   +2 more sources

Nonlocal graph regularization for image colorization

open access: yes, 2008
International audienceIn this paper we present a simple colorization method that relies on nonlocal graph regularization. We introduce nonlocal discrete differential operators and a family of weighted p-Laplace operators.
Abderrahim Elmoataz   +5 more
core   +1 more source

GrSrNMF: dynamic community detection with graph and symmetry bi-regularized non-negative matrix factorization

open access: yesScientific Reports
Community detection in dynamic networks has become an interesting and popular research direction in recent years, widely used in electronic commerce, social media, and other fields.
Wei Yu   +6 more
doaj   +1 more source

Stable Imitation of Multigait and Bipedal Motions for Quadrupedal Robots Over Uneven Terrains

open access: yesAdvanced Robotics Research, EarlyView.
How are quadrupedal robots empowered to execute complex navigation tasks, including multigait and bipedal motions? Challenges in stability and real‐world adaptation persist, especially with uneven terrains and disturbances. This article presents an imitation learning framework that enhances adaptability and robustness by incorporating long short‐term ...
Erdong Xiao   +3 more
wiley   +1 more source

Online learning over graphs

open access: yes, 2005
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simple algorithms and performance guarantees that we naturally interpret in ...
Mark Herbster   +5 more
core   +1 more source

Double regularized matrix factorization for image classification and clustering

open access: yesEURASIP Journal on Image and Video Processing, 2018
Feature selection, which aims to select an optimal feature subset to avoid the “curse of dimensionality,” is an important research topic in many real-world applications.
Wei Zhou   +4 more
doaj   +1 more source

Home - About - Disclaimer - Privacy