Results 61 to 70 of about 1,405 (240)

Minimum Fill-in of Sparse Graphs: {Kernelization} and Approximation [PDF]

open access: yes, 2015
The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. The problem has important applications in numerical algebra, in particular in sparse matrix computations.
Villanger, Y.   +5 more
core   +3 more sources

Kernel Thinning

open access: yesJ. Mach. Learn. Res., 2021
Accepted for presentation as an extended abstract at the Conference on Learning Theory (COLT) 2021, and published in the Journal of Machine Learning Research (JMLR ...
Raaz Dwivedi, Lester Mackey
openaire   +4 more sources

Molecular Diagnosis in Children With Febrile Seizures: Beyond the Conventional Clinical Classification

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Febrile seizures (FS) are currently classified as simple or complex primarily to describe seizure characteristics, with limited ability to identify the underlying etiology. We evaluated whether molecular diagnosis could complement conventional classification and improve the diagnosis and management of FS.
Jia Wang   +22 more
wiley   +1 more source

Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions

open access: yesJournal of Graph Algorithms and Applications
A kernelization for a parameterized decision problem Q is a polynomial-time preprocessing algorithm that reduces any parameterized instance (x, k) into an instance (x', k') whose size is bounded by a function of k alone and which has the same yes/no ...
Bart M. P. Jansen   +1 more
doaj   +1 more source

Palmprint and Face Multi-Modal Biometric Recognition Based on SDA-GSVD and Its Kernelization

open access: yesSensors, 2012
When extracting discriminative features from multimodal data, current methods rarely concern themselves with the data distribution. In this paper, we present an assumption that is consistent with the viewpoint of discrimination, that is, a person’s ...
Jing-Yu Yang   +6 more
doaj   +1 more source

dynoGP: Deep Gaussian Processes for Dynamic System Identification

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli   +3 more
wiley   +1 more source

Dynamic Meta-Kernelization [PDF]

open access: yes
Kernelization studies polynomial-time preprocessing algorithms. Over the last 20 years, the most celebrated positive results of the field have been linear kernels for classical NP-hard graph problems on sparse graph classes.
Bertram, Christian   +3 more
core   +1 more source

Characterization of Defect Distribution in an Additively Manufactured AlSi10Mg as a Function of Processing Parameters and Correlations with Extreme Value Statistics

open access: yesAdvanced Engineering Materials, EarlyView.
Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt   +8 more
wiley   +1 more source

Kernelization via Combinatorial Optimization

open access: yes, 2009
International audienceA graph parameter $\pi$ has {\it polynomial kernelization} if there exists an algorithm which has input a pair $(G,k)$ where $G$ is a graph of size $n$ and $k$ is an integer and outputs $(G',k')$ where $\pi(G)\leq k$ iff $\pi(G ...
Thomassé, Stéphan
core   +2 more sources

A Kernel for the Maximum Agreement Forest Problem on Multiple Binary Phylogenetic Trees

open access: yesJournal of Graph Algorithms and Applications
The maximum agreement forest (MAF) problem in phylogenetics takes as input a set $t \geq 2$ of binary phylogenetic trees $\mathcal T$ on the same set of taxa $X$.
Steven Kelk   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy