Results 11 to 20 of about 407,965 (310)
Quasi-cyclic subcodes of cyclic codes [PDF]
, 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
A bijection between planar constellations and some colored Lagrangian trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Constellations are colored planar maps that generalize different families of maps (planar maps, bipartite planar maps, bi-Eulerian planar maps, planar cacti, ...) and are strongly related to factorizations of permutations.
Cedric Chauve
doaj +1 more source
Paradigms for Parameterized Enumeration [PDF]
, 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 +2 more sources
Robust M-Estimation Based Bayesian Cluster Enumeration for Real Elliptically Symmetric Distributions
, 2021 Robustly determining the optimal number of clusters in a data set is an essential factor in a wide range of applications. Cluster enumeration becomes challenging when the true underlying structure in the observed data is corrupted by heavy-tailed noise ...
Muma, Michael, Schroth, Christian A.
core +1 more source
Feat: Functional Enumeration of Algebraic Types [PDF]
, 2012 In mathematics, an enumeration of a set S is a bijective function from (an initial segment of) the natural numbers to S. We define "functional enumerations" as efficiently computable such bijections.
Duregard, Jonas +2 more
core +2 more sources
Journal of Computer and System Sciences, 2012 The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision version of the homomorphism problem received a lot of attention in literature; in particular, the way the graph-theoretical structure of the variables and constraints ...
Bulatov, Andrei A. +3 more
openaire +5 more sources
Water Alternatives, 2021 Numeric abstractions relied upon by modern water management are reductive by design, but their political effects need not be reductionist, as an example from Bengaluru attests.
Lindsay Vogt
doaj
Enumerations including laconic enumerators
Theoretical Computer Science, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jain, Sanjay, Teutsch, Jason
openaire +1 more source
ENUMERATION AS A MEANS OF FINANCIAL MARKETS DATA REPRESENTATION
Novìtnâ Osvìta, 2016 Cognitive linguistics has developed into one of the most attractive and influential frameworks within linguistics at large. And it draws the linguists’ attention to the study of aspects of language within cognitive paradigm as reflections of conceptual ...
Maryna Antonova
doaj +1 more source
A simple recurrence formula for the number of rooted maps on surfaces by edges and genus [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. The formula is a consequence of the KP equation for the generating function of bipartite maps, coupled with a Tutte equation, and it was
Sean Carrell, Guillaume Chapuy
doaj +1 more source