Results 21 to 30 of about 1,317,810 (296)
Improved Combinatorial Approximations for Weighted Correlation Clustering [PDF]
We present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity.
Mojtaba Ostovari, Alireza Zarei
doaj +1 more source
The aim of this paper is to construct generating functions for new families of combinatorial numbers and polynomials. By using these generating functions with their functional and differential equations, we not only investigate properties of these new ...
Irem Kucukoglu +2 more
doaj +1 more source
This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic circuits. The relations among the statistical, algorithmic, computational, and circuit complexities of states are reviewed.
Bao Gia Bach +3 more
doaj +1 more source
Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits
Motivated by concerns about making online decisions that incur undue amount of risk at each time step, in this paper, we formulate the probably anytime-safe stochastic combinatorial semi-bandits problem. In this problem, the agent is given the option to select a subset of size at most $K$ from a set of $L$ ground items.
Yunlong Hou 0001 +2 more
openaire +4 more sources
Stanley's character polynomials and coloured factorisations in the symmetric group [PDF]
In Stanley [R.P. Stanley, Irreducible symmetric group characters of rectangular shape, Sém. Lothar. Combin. 50 (2003) B50d, 11 p.] the author introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of ...
Rattan, Amarpreet, Rattan, A.
core +1 more source
Combinatorial library diversity: probability assessment of library populations [PDF]
A method is described for measuring the diversity of combinatorial oligonucleotide libraries that entails extrapolating the base composition of a co-synthesized model library (dNC, N = A, C, G, T) to that of a multibase library template. The base composition of dNC was measured by HPLC.
B, Ward, T, Juehne
openaire +2 more sources
Considerations on probability: from games of chance to modern science
The article sets out a number of considerations on the distinction between variability and uncertainty over the centuries. Games of chance have always been useful random experiments which through combinatorial calculation have opened the way to ...
Paola Monari
doaj +1 more source
Symmetry, Probabiliy, Entropy: Synopsis of the Lecture at MAXENT 2014
In this discussion, we indicate possibilities for (homological and non-homological) linearization of basic notions of the probability theory and also for replacing the real numbers as values of probabilities by objects of suitable combinatorial ...
Misha Gromov
doaj +1 more source
Geometrical Theory on Combinatorial Manifolds [PDF]
Topological and differential structures such as those of d-pathwise connected, homotopy classes, fundamental d-groups in topology and tangent vector fields, tensor fields, connections, Minkowski norms in differential geometry on these finitely ...
Mao, Linfan
core +1 more source
Research on Universal Combinatorial Coding
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods.
Jun Lu, Zhuo Zhang, Juan Mo
doaj +1 more source

