Results 41 to 50 of about 111,097 (310)
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning [PDF]
We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Constraint Satisfaction, Global Constraints, Satisfiability, Nonmonotonic and ...
Gaspers, Serge, Szeider, Stefan
core +1 more source
Kernelized Cumulants: Beyond Kernel Mean Embeddings
In $\mathbb R^d$, it is well-known that cumulants provide an alternative to moments that can achieve the same goals with numerous benefits such as lower variance estimators. In this paper we extend cumulants to reproducing kernel Hilbert spaces (RKHS) using tools from tensor algebras and show that they are computationally tractable by a kernel trick ...
Bonnier, Patric +2 more
openaire +3 more sources
On Polynomial Kernels for Integer Linear Programs: Covering, Packing and Feasibility [PDF]
We study the existence of polynomial kernels for the problem of deciding feasibility of integer linear programs (ILPs), and for finding good solutions for covering and packing ILPs. Our main results are as follows: First, we show that the ILP Feasibility
Kratsch, Stefan
core +1 more source
A randomized polynomial kernel for Subset Feedback Vertex Set [PDF]
The Subset Feedback Vertex Set problem generalizes the classical Feedback Vertex Set problem and asks, for a given undirected graph $G=(V,E)$, a set $S \subseteq V$, and an integer $k$, whether there exists a set $X$ of at most $k$ vertices such that no ...
Hols, Eva-Maria C., Kratsch, Stefan
core +2 more sources
Budgeted Passive-Aggressive Learning for Online Multiclass Classification
Online multiclass classification is a specific problem of online learning that performs a sequence of multiclass classification tasks given the knowledge of previous tasks. The goal is to make correct predictions for this sequence.
Chung-Hao Wu +2 more
doaj +1 more source
Mod/Resc Parsimony Inference [PDF]
We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insect populations infected by inherited, intra-cellular parasitic bacteria.
A.D. Korshunov +15 more
core +6 more sources
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices [PDF]
We study the Steiner Tree problem, in which a set of terminal vertices needs to be connected in the cheapest possible way in an edge-weighted graph. This problem has been extensively studied from the viewpoint of approximation and also parametrization ...
Dvořák, Pavel +5 more
core +3 more sources
Object matching is a fundamental operation in data analysis. It typically requires the definition of a similarity measure between the classes of objects to be matched. Instead, we develop an approach which is able to perform matching by requiring a similarity measure only within each of the classes. This is achieved by maximizing the dependency between
Novi, Quadrianto +3 more
openaire +3 more sources
Hierarchical Kernel And Sub-Kernels [PDF]
This paper shows the theoretical development of hierarchy by kernels and an algorithm used to obtain an interesting class or partition from a hierarchy. Also shown is the theorem about the Kernels Optimal Criterion and how it is expressed as a function of the masses of the points of the vector space and product scale points, the inertia of the cloud ...
openaire +2 more sources
Progressive Line Processing of Kernel RX Anomaly Detection Algorithm for Hyperspectral Imagery
The Kernel-RX detector (KRXD) has attracted widespread interest in hyperspectral image processing with the utilization of nonlinear information. However, the kernelization of hyperspectral data leads to poor execution efficiency in KRXD.
Chunhui Zhao +3 more
doaj +1 more source

