Results 21 to 30 of about 1,405 (240)
Old and longer version of the JMLR paper with same title (published 2018). Please start with the JMLR version. 55 pages (33 pages main text, 22 pages appendix), 2 tables, 1 figure (in appendix)
Simon-Gabriel, C., Schölkopf, B.
openaire +5 more sources
Kernels in digraphs that are not kernel perfect
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sjur K. Dyrkolbotn, Michal Walicki
openaire +3 more sources
Kernelization of Counting Problems [PDF]
We introduce a new framework for the analysis of preprocessing routines for parameterized counting problems. Existing frameworks that encapsulate parameterized counting problems permit the usage of exponential (rather than polynomial) time either ...
Lokshtanov, Daniel +3 more
core
PACE Solver Description: Cluster Editing Kernelization Using CluES [PDF]
This article briefly describes the most important algorithms and techniques used in the cluster editing kernelization solver called "CluES", submitted to the 6th Parameterized Algorithms and Computational Experiments Challenge (PACE 2021)
Swat, Sylwester
core +1 more source
Parameter Ecology for Feedback Vertex Set
This paper deals with the Feedback Vertex Set problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles.
Bart M. P. Jansen +2 more
doaj +1 more source
A Retrospective on (Meta) Kernelization
International audienceIn parameterized complexity, a {\em kernelization algorithm} can be seen as a reduction of a parameterized problem to itself, so that the produced equivalent instance has size depending exclusively on the parameter.
Dimitrios M. Thilikos +1 more
core +1 more source
A Dimension Reduction Framework for HSI Classification Using Fuzzy and Kernel NFLE Transformation
In this paper, a general nearest feature line (NFL) embedding (NFLE) transformation called fuzzy-kernel NFLE (FKNFLE) is proposed for hyperspectral image (HSI) classification in which kernelization and fuzzification are simultaneously considered.
Ying-Nong Chen +4 more
doaj +1 more source
A Brief Survey of Fixed-Parameter Parallelism
This paper provides an overview of the field of parameterized parallel complexity by surveying previous work in addition to presenting a few new observations and exploring potential new directions.
Faisal N. Abu-Khzam, Karam Al Kontar
doaj +1 more source
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 +5 more sources
What is known about Vertex Cover Kernelization? [PDF]
25 pages, 10 figures. Appeared in volume 11011 of LNCS, pages 330-356, see Reference [29] in the text. Compared to [29], this arXiv-upload contains a fixed version of Reduction R.8, the order of presentation of Reductions R.6 and R.7 has been switched ...
Jaffke, Lars +11 more
core +1 more source

