相关论文: A Discrete Choquet Integral for Ordered Systems
We present a Dirichlet process mixture model over discrete incomplete rankings and study two Gibbs sampling inference techniques for estimating posterior clusterings. The first approach uses a slice sampling subcomponent for estimating…
We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their intersection can be computed in a worst-case efficient way. In…
Many complex engineering systems consist of multiple subsystems that are developed by different teams of engineers. To analyse, simulate and control such complex systems, accurate yet computationally efficient models are required. Modular…
We construct integrals of motion for multidimensional classical systems from ladder operators of one-dimensional systems. This method can be used to obtain new systems with higher order integrals. We show how these integrals generate a…
We study the multiplicity number of the characteristic cycle of the intersection complex of the matroid Schubert variety. It is shown to be a combinatorial invariant, and it can be computed by explicit formulas. We also conjecture that the…
We prove a representation theorem for the Choquet integral model. The preference relation is defined on a two-dimensional heterogeneous product set $X = X_1 \times X_2$ where elements of $X_1$ and $X_2$ are not necessarily comparable with…
A coreset (or core-set) of an input set is its small summation, such that solving a problem on the coreset as its input, provably yields the same result as solving the same problem on the original (full) set, for a given family of problems…
We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…
A total set of $n$ states $|i\rangle$ and the corresponding projectors $\Pi(i)=|i\rangle \langle i|$ are considered, in a quantum system with $d$-dimensional Hilbert space $H(d)$. A partially known density matrix $\rho$ with given…
This paper constructs a combinatorial model for all postcritically finite rational maps arising as the Newton's method of a complex polynomial. This model is used in [LMS] to give a combinatorial classification of postcritically finite…
This paper studies non-cooperative games where players are allowed to play their mixed non-additive strategies. Expected payoffs are expressed by so-called fuzzy integrals: Choquet integral, Sugeno integral and generalizations of Sugeno…
For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…
The Obreshkov method is a single-step multi-derivative method used in the numerical solution of differential equations and has been used in recent years in efficient circuit simulation. It has been shown that it can be made of arbitrary…
We consider the problem of solving a linear system of equations which involves complex variables and their conjugates. We characterize when it reduces to a complex linear system, that is, a system involving only complex variables (and not…
In this paper, we obtain some new results on closed subschemes. Specially, we define natural addition and multiplication on the closed subschemes of a scheme. It is shown that "the multiplication" precisely coincides with the well known…
We develop the theory of mixed finite elements in terms of special inverse systems of complexes of differential forms, defined over cellular complexes. Inclusion of cells corresponds to pullback of forms. The theory covers for instance…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs…
In Bayesian inference for mixture models with an unknown number of components, a finite mixture model is usually employed that assumes prior distributions for mixing weights and the number of components. This model is called a mixture of…