Results 271 to 280 of about 708,932 (315)
SnRK2.6 phosphorylates sucrose transporter ZmSUT1 to enhance yield by modulating leaf senescence in maize. [PDF]
Yang T +13 more
europepmc +1 more source
RF-SVR-based prediction methodology for metal tube-bending rebound: Handling non-uniformity and limited sample challenges. [PDF]
Fang Z, Zhang P, Li L, Zhang Q.
europepmc +1 more source
Integrated transcriptomic and metabolomic profiles analysis reveals a potential gene-metabolite network associated with anthocyanin-mediated color variation in maize kernels. [PDF]
Ran J +10 more
europepmc +1 more source
Kernel Factory: An ensemble of kernel machines [PDF]
We propose an ensemble method for kernel machines. The training data is randomly split into a number of mutually exclusive partitions defined by a row and column parameter. Each partition forms an input space and is transformed by an automatically selected kernel function into a kernel matrix K.
Michel Ballings, Dirk Van den Poel
openaire +1 more source
Multiple Kernel k-means with Incomplete Kernels [PDF]
Multiple kernel clustering (MKC) algorithms optimally combine a group of pre-specified base kernel matrices to improve clustering performance. However, existing MKC algorithms cannot efficiently address the situation where some rows and columns of base kernel matrices are absent.
Marius Kloft +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2011 International Conference on Computer Vision, 2011
Naive Bayes Nearest Neighbor (NBNN) has recently been proposed as a powerful, non-parametric approach for object classification, that manages to achieve remarkably good results thanks to the avoidance of a vector quantization step and the use of image-to-class comparisons, yielding good generalization.
Tinne Tuytelaars +3 more
openaire +2 more sources
Naive Bayes Nearest Neighbor (NBNN) has recently been proposed as a powerful, non-parametric approach for object classification, that manages to achieve remarkably good results thanks to the avoidance of a vector quantization step and the use of image-to-class comparisons, yielding good generalization.
Tinne Tuytelaars +3 more
openaire +2 more sources
Partitionable Kernels for Mapping Kernels
2011 IEEE 11th International Conference on Data Mining, 2011Many of tree kernels in the literature are designed tanking advantage of the mapping kernel framework. The most important advantage of using this framework is that we have a strong theorem to examine positive definiteness of the resulting tree kernels.
openaire +1 more source
Multiple kernel clustering with corrupted kernels
Neurocomputing, 2017Abstract Multiple kernel clustering (MKC) algorithms usually learn an optimal kernel from a group of pre-specified base kernels to improve the clustering performance. However, we observe that existing MKC algorithms do not well handle the situation that kernels are corrupted with noise and outliers.
Teng Li 0010 +4 more
openaire +1 more source
Communications of the ACM, 2018
Choosing between programming in the kernel or in user space.
openaire +1 more source
Choosing between programming in the kernel or in user space.
openaire +1 more source

