Results 31 to 40 of about 1,405 (240)
Meta-kernelization using Well-structured Modulators [PDF]
Kernelization investigates exact preprocessing algorithms with performance guarantees. The most prevalent type of parameters used in kernelization is the solution size for optimization problems; however, also structural parameters have been successfully ...
Ganian, Robert +2 more
core +1 more source
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
The main purpose of this paper is to exposit two very different, but very general, motivational schemes in the art of parameterization and a concrete example connecting them.
Rodney G. Downey +4 more
doaj +1 more source
Extreme Learning Machine (ELM) is widely used in various fields because of its fast training and high accuracy. However, it does not primarily work well for Domain Adaptation (DA) in which there are many annotated data from auxiliary domain and few even ...
Shaofei Zang +5 more
doaj +1 more source
Circumventing Connectivity for Kernelization [PDF]
Classical vertex subset problems demanding connectivity are of the following form: given an input graph G on n vertices and an integer k, find a set S of at most k vertices that satisfies a property and G[S] is connected.
Roy, Shivesh; id_orcid +9 more
core +1 more source
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Robert Bredereck +5 more
doaj +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.
Gao, Wen +9 more
openaire +3 more sources
A Kernelized Unified Framework for Domain Adaptation
The performance of the supervised learning algorithms such as k-nearest neighbor (k-NN) depends on the labeled data. For some applications (Target Domain), obtaining such labeled data is very expensive and labor-intensive.
Rakesh Kumar Sanodiya +3 more
doaj +1 more source
Improving Vertex Cover as a Graph Parameter [PDF]
Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
doaj +1 more source
For finding keys to understand and elucidate a phenomenon, it is essential to detect dependences among variables, and so measures for that have been proposed.
Miho Ohsaki +7 more
doaj +1 more source
Regularization and Kernelization of the Maximin Correlation Approach
Robust classification becomes challenging when each class consists of multiple subclasses. Examples include multi-font optical character recognition and automated protein function prediction.
Taehoon Lee +3 more
doaj +1 more source

