Results 91 to 100 of about 1,405 (240)
An organic neuromorphic architecture for the classification of human motor behavior is presented and validated. It performs somatic integration by linearly combining the activity from three muscles. An investigation of synaptic weights is presented and discussed in relationship with the classification performance.
Ilenia Sergi +7 more
wiley +1 more source
Therapies consisting of a combination of agents are an attractive proposition, especially in the context of diseases such as cancer, which can manifest with a variety of tumor types in a single case.
Drew Mellor +3 more
doaj +1 more source
We present a framework for efficient extrapolation of reduced rank approximations, graph kernels, and locally linear embeddings (LLE) to unseen data. We also present a principled method to combine many of these kernels and then extrapolate them. Central to our method is a theorem for matrix approximation, and an extension of the representer theorem to ...
S. V. N. Vishwanathan +3 more
openaire +5 more sources
A Completeness Theory for Polynomial (Turing) Kernelization [PDF]
The framework of Bodlaender et al. (J Comput Sys Sci 75(8):423–434, 2009) and Fortnow and Santhanam (J Comput Sys Sci 77(1):91–106, 2011) allows us to exclude the existence of polynomial kernels for a range of problems under reasonable complexity ...
Hermelin, Danny +9 more
core +1 more source
Intracrystalline Void‐Mediated Toughening of Brittle Crystals in Quail Eggshells
In quail eggshells, the high density and disordered arrangement of intracrystalline voids inhibit lattice cleavage, suppress long‐range crack propagation, and promote deformation twinning and quasi‐plasticity, serving as an essential toughening motif. We show that these voids remain within a narrow subcritical size range and therefore predominantly do ...
Jingxiao Zhong +16 more
wiley +1 more source
Exploiting $\mathbf{c}$-Closure in Kernelization Algorithms for Graph Problems [PDF]
A graph is c-closed if every pair of vertices with at least c common neighbors is adjacent. The c-closure of a graph G is the smallest number such that G is c-closed. Fox et al.
Komusiewicz, Christian +2 more
core +1 more source
Correspondence of NNGP Kernel and the Matern Kernel
Kernels representing limiting cases of neural network architectures have recently gained popularity. However, the application and performance of these new kernels compared to existing options, such as the Matern kernel, is not well studied. We take a practical approach to explore the neural network Gaussian process (NNGP) kernel and its application to ...
Amanda Muyskens +3 more
openaire +2 more sources
On Kernelization and Approximation for the Vector Connectivity Problem [PDF]
In the Vector Connectivity problem we are given an undirected graph G=(V,E), a demand function phi: V => {0,...,d}, and an integer k. The question is whether there exists a set S of at most k vertices such that every vertex v in V\S has at least phi(v ...
Manuel Sorge +3 more
core +1 more source
Zirconium interstitials (Zri4) directly imaged and identified in Ce0.9Zr0.1O2 thin films grown by pulsed‐laser deposition. Multislice electron ptychography and quantitative analysis reveal substantial Zri4 +$^+$ concentration, neighboring cation displacements, oxygen‐vacancy association, and pronounced Zri4 +$^+$ off‐centering.
Jingrui Wei +7 more
wiley +1 more source
A cutset-type kernel possibilistic fuzzy c-means method for robust image segmentation
BackgroundRobust image segmentation remains difficult for lightweight unsupervised clustering when nonlinear class overlap and sparse noise contamination occur together.MethodsThis study proposes and evaluates a cutset-type kernel possibilistic fuzzy c ...
Jintao Wang +4 more
doaj +1 more source

