Results 31 to 40 of about 394,763 (294)
, 2016 We introduce the Mondrian kernel, a fast random feature approximation to the Laplace kernel. It is suitable for both batch and online learning, and admits a fast kernel-width-selection procedure as the random features can be re-used efficiently for all kernel widths.
Balog, M +4 more
openaire +4 more sources
Bidimensionality and Kernels [PDF]
SIAM Journal on Computing, 2010 Bidimensionality Theory was introduced by [E.D. Demaine, F.V. Fomin, M.Hajiaghayi, and D.M. Thilikos. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, J. ACM, 52 (2005), pp.866--893] as a tool to obtain sub-exponential time parameterized algorithms on H-minor-free graphs. In [E.D.
Fedor V. Fomin +3 more
openaire +5 more sources
J. Mach. Learn. Res., 2016 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
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
Tsinghua Science and Technology, 2014 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
A Turing Kernelization Dichotomy for Structural Parameterizations of F-Minor-Free Deletion [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 2019 For a fixed finite family of graphs $\mathcal{F}$, the $\mathcal{F}$-Minor-Free Deletion problem takes as input a graph $G$ and an integer $\ell$ and asks whether there exists a set $X \subseteq V(G)$ of size at most $\ell$ such that $G-X$ is $\mathcal{F}
Huib Donkers, B. Jansen
semanticscholar +1 more source
Kernels in digraphs that are not kernel perfect
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sjur K. Dyrkolbotn, Michal Walicki
openaire +2 more sources
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Tsinghua Science and Technology, 2014 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
A Brief Survey of Fixed-Parameter Parallelism
Algorithms, 2020 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
Complexity, 2022 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
Parameter Ecology for Feedback Vertex Set
Tsinghua Science and Technology, 2014 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