Results 11 to 20 of about 1,718 (301)
Why partitive? Possible motivations for the partitive complement of Finnic adpositions
Eesti ja Soome-ugri Keeleteaduse AjakiriAdpositions localize an entity (Figure) with respect to another entity (Ground), designated by the complement of the adposition. Most Finnic adpositions are postpositions with a genitive Ground, while prepositions typically have a partitive Ground ...
Tuomas Huumo
doaj +3 more sources
Designs, Codes and Cryptography, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nurdagül Anbar, Wilfried Meidl
openaire +4 more sources
Parity biases in partitions and restricted partitions [PDF]
European Journal of Combinatorics, 2022 19 pages, revised based on referee ...
Koustav Banerjee +4 more
openaire +3 more sources
Partitive Determiners, Partitive Pronouns and Partitive Case [PDF]
, 2022 One important function of the Finnish partitive case is the expression of unbounded quantity. An unbounded quantity can consist of a homogeneous substance, expressed by a mass noun in the partitive singular, or of a multiplicity, expressed by the ...
Huumo Tuomas
core +1 more source
Glossa: a journal of general linguistics, 2019 The paper offers a broad overview of several structures that fall under the umbrella term of “partitives”. It surveys previous analyses and proposes a treatment based on two null operators, PART% and PARTPRO, with different syntactic and semantic properties.
Falco, Michelangelo, Zamparelli, Roberto
openaire +3 more sources
Discrete Mathematics & Theoretical Computer Science, 2007 Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition.
BURDERI, Fabio, RESTIVO, Antonio
openaire +4 more sources
Rethinking case marking and case alternation in Estonian [PDF]
, 2013 In this paper, we argue for a view of case marking that does not treat case as the passive realisation of other morpho-syntactic properties of a construction but as independently bringing information to a clause.
Merilin Miljan +3 more
core +1 more source
Information Processing Letters, 2002 This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed computations of the form $a^n$ mod m. The main contribution of this paper is a correction to the upper bound on the number of
William M. Y. Goh +2 more
openaire +2 more sources
Probabilistic Partitive Partitioning (PPP)
CoRR, 2020 Clustering is a NP-hard problem. Thus, no optimal algorithm exists, heuristics are applied to cluster the data. Heuristics can be very resource-intensive, if not applied properly. For substantially large data sets computational efficiencies can be achieved by reducing the input space if a minimal loss of information can be achieved.
openaire +2 more sources
European Journal of Combinatorics, 2005 The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the algebra depend polynomially on a parameter.
Tom Halverson, Arun Ram
openaire +3 more sources