Results 11 to 20 of about 512,416 (331)

Enumeration of Enumeration Algorithms [PDF]

open access: yesarXiv, 2016
In this paper, we enumerate enumeration problems and algorithms. This survey is under construction. If you know some results not in this survey or there is anything wrong, please let me know.
arxiv   +3 more sources

Paradigms for Parameterized Enumeration [PDF]

open access: yesTheory of Computing Systems, 2013
The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity.
D. Marx   +7 more
core   +7 more sources

Enumeration of irredundant forests [PDF]

open access: yesTheoretical Computer Science, 2022
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees. If the literature proposes solutions to enumerate singletons of trees, we study in this article a more general ...
Ingels, Florian, Azaïs, Romain
openaire   +3 more sources

GPU-Accelerated Subgraph Enumeration on Partitioned Graphs

open access: yesSIGMOD Conference, 2020
Subgraph enumeration is important for many applications such as network motif discovery and community detection. Recent works utilize graphics processing units (GPUs) to parallelize subgraph enumeration, but they can only handle graphs that fit into the ...
Wentian Guo   +5 more
semanticscholar   +1 more source

Pivot-based Maximal Biclique Enumeration

open access: yesInternational Joint Conference on Artificial Intelligence, 2020
Enumerating maximal bicliques in a bipartite graph is an important problem in data mining, with innumerable real-world applications across different domains such as web community, bioinformatics, etc.
Aman Abidi   +3 more
semanticscholar   +1 more source

Enumeration 1-Genericity in the Local Enumeration Degrees [PDF]

open access: yesNotre Dame Journal of Formal Logic, 2018
We discuss a notion of forcing that characterizes enumeration 1-genericity, and we investigate the immunity, lowness, and quasiminimality properties of enumeration 1-generic sets and their degrees. We construct an enumeration operator Δ such that, for any A, the set ΔA is enumeration 1-generic and has the same jump complexity as A.
Badillo, Liliana   +2 more
openaire   +3 more sources

Quasi-cyclic subcodes of cyclic codes [PDF]

open access: yes, 2016
We completely characterize possible indices of quasi-cyclic subcodes in a cyclic code for a very broad class of cyclic codes. We present enumeration results for quasi-cyclic subcodes of a fixed index and show that the problem of enumeration is equivalent
Belfiore, Jean-Claude   +2 more
core   +3 more sources

Robust enumeration of cell subsets from tissue expression profiles

open access: yesNature Methods, 2015
We introduce CIBERSORT, a method for characterizing cell composition of complex tissues from their gene expression profiles. When applied to enumeration of hematopoietic subsets in RNA mixtures from fresh, frozen and fixed tissues, including solid tumors,
Aaron M. Newman   +8 more
semanticscholar   +1 more source

Efficient Maximal Balanced Clique Enumeration in Signed Networks

open access: yesThe Web Conference, 2020
Clique is one of the most fundamental models for cohesive subgraph mining in network analysis. Existing clique model mainly focuses on unsigned networks.
Zi Chen   +4 more
semanticscholar   +1 more source

Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration [PDF]

open access: yesACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2019
As data analytics becomes more crucial to digital systems, so grows the importance of characterizing the database queries that admit a more efficient evaluation.
Nofar Carmeli   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy