Results 61 to 70 of about 1,490 (139)

An Algorithm for the Exact Treedepth Problem

, 2020
14 pages, 6 figures, 2 tables. This is an extended version of a paper to appear in the proceedings of SEA 2020. The arXiv version is the conference version plus Appendix A (a correctness proof)
openaire   +4 more sources

Random model trees: an effective and scalable regression method [PDF]

, 2010
We present and investigate ensembles of randomized model trees as a novel regression method. Such ensembles combine the scalability of tree-based methods with predictive performance rivaling the state of the art in numeric prediction.
Pfahringer, Bernhard
core   +1 more source

Fixed-Parameter Tractability of Token Jumping on Planar Graphs

, 2015
Suppose that we are given two independent sets $I_0$ and $I_r$ of a graph such that $|I_0| = |I_r|$, and imagine that a token is placed on each vertex in $I_0$. The token jumping problem is to determine whether there exists a sequence of independent sets
AE Mouawad, M Bonamy, M Kamiński, N Robertson, P Bonsma, P Bonsma, P Gopalan, RA Hearn, RL Graham, T Ito, T Ito, T Ito, T Ito   +12 more
core   +1 more source

Computing Treedepth Obstructions

The graph parameter treedepth is minor-monotone; hence, the class of graphs with treedepth at most $k$ is minor-closed. By the Graph Minor Theorem, such a class is characterized by a finite set of forbidden minors. A conjecture of Dvořák, Giannopoulou, and Thilikos states that every such forbidden minor has at most $2^k$ vertices.
openaire   +2 more sources

Treedepth Inapproximability and Exponential ETH Lower Bound

Treedepth is a central parameter to algorithmic graph theory. The current state-of-the-art in computing and approximating treedepth consists of a $2^{O(k^2)} n$-time exact algorithm and a polynomial-time $O(\text{OPT} \log^{3/2} \text{OPT})$-approximation algorithm, where the former algorithm returns an elimination forest of height $k$ (witnessing that
Bonnet, Édouard, Neuen, Daniel, Sokołowski, Marek   +2 more
openaire   +3 more sources

An Algorithmic Theory of Integer Programming

, 2019
We study the general integer programming problem where the number of variables $n$ is a variable part of the input. We consider two natural parameters of the constraint matrix $A$: its numeric measure $a$ and its sparsity measure $d$.
Eisenbrand, Friedrich, Hunkenschröder, Christoph, Klein, Kim-Manuel, Koutecký, Martin, Levin, Asaf, Onn, Shmuel   +5 more
core  

What does Chinese BERT learn about syntactic knowledge? [PDF]

PeerJ Comput Sci, 2023
Zheng J, Liu Y.
europepmc   +1 more source

Token Jumping in minor-closed classes

, 2017
Given two $k$-independent sets $I$ and $J$ of a graph $G$, one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex of the current independent set by another while keeping the property of ...
AE Mouawad, AE Mouawad, D Lokshtanov, D Marx, ED Demaine, M Bonamy, M Kamiński, N Bousquet, OJ Murphy, P Bonsma, P Bonsma, P Gopalan, R Diestel, R Hearn, T Ito, T Ito, T Ito, T Kővári, Z Fredi   +18 more
core   +3 more sources

Implementation of Algorithms Based on Decision Trees in C# [PDF]

, 2013
Tato bakalářská práce se zabývá výběrem dolovacích algoritmů pro klasifikaci založených na rozhodovacích stromech pro analytický systém vyvíjený v rámci projektu Systém pro zvýšení bezpečnosti v prostředí Internetu analýzou šíření škodlivého kódu.
Grolig, Lukáš
core  

Mining Modules of Data Mining System on NetBeans Platform [PDF]

, 2009
Diplomová práce se zabývá problematikou získávání znalostí z databází a rozšířením systému pro dolování z dat v prostředí Oracle vyvíjený na VUT FIT. V koncepci jádra tohoto systému je zabudováno rozhraní, umožňující přidávání dolovacích modulů.
Henkl, Tomáš
core