Results 41 to 50 of about 1,884,911 (319)

Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius [PDF]

Symposium on the Theory of Computing, 2019
List-decoding of Reed-Solomon (RS) codes beyond the so called Johnson radius has been one of the main open questions in coding theory and theoretical computer science since the work of Guruswami and Sudan.
Chong Shangguan, Itzhak Tamo
semanticscholar   +1 more source

Recipes and Economic Growth: A Combinatorial March Down an Exponential Tail

Journal of Political Economy, 2021
As Romer and Weitzman emphasized in the 1990s, new ideas are often combinations of existing ideas, an insight absent from recent models. In Kortum's research around the same time, ideas are draws from a probability distribution, and Pareto distributions ...
C. I. Jones
semanticscholar   +1 more source

Improved Combinatorial Approximations for Weighted Correlation Clustering [PDF]

Discrete Mathematics & Theoretical Computer Science
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

Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis

Entropy, 2023
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, Akash Kundu, Tamal Acharya, Aritra Sarkar   +3 more
doaj   +1 more source

Percolation on the average and spontaneous magnetization for q-states Potts model on graph [PDF]

, 2003
We prove that the q-states Potts model on graph is spontaneously magnetized at finite temperature if and only if the graph presents percolation on the average.
A Vezzani, Aizenman M, Alexander S, Burioni R, Burioni R, Burioni R, Fortuin C M, Harari F, Holley R, Häggström O, Shinoda M, Stauffer D, Vezzani A, Wu F Y   +13 more
core   +2 more sources

Probably Anytime-Safe Stochastic Combinatorial Semi-Bandits

, 2023
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.
Hou, Yunlong, Tan, Vincent Y. F., Zhong, Zixin   +2 more
openaire   +2 more sources

Asymptotics of Selberg-like integrals by lattice path counting [PDF]

, 2011
We obtain explicit expressions for positive integer moments of the probability density of eigenvalues of the Jacobi and Laguerre random matrix ensembles, in the asymptotic regime of large dimension.
Aomoto, Bai, Baranger, Beenakker, Berkolaiko, Brouwer, Brouwer, Brouwer, Di Francesco, Dyson, Forrester, Forrester, Forrester, Forrester, Kadell, Kaneko, Keating, Khoruzhenko, Luque, Marcel Novaes, Mehta, Muirhead, Novaes, Novaes, Savin, Savin, Vivo   +26 more
core   +1 more source

Combinatorial Multi-Armed Bandits with Concave Rewards and Fairness Constraints

International Joint Conference on Artificial Intelligence, 2020
The problem of multi-armed bandit (MAB) with fairness constraint has emerged as an important research topic recently. For such problems, one common objective is to maximize the total rewards within a fixed round of pulls, while satisfying the fairness ...
Huanle Xu, Yang Liu, Wing Cheong Lau, Rui Li   +3 more
semanticscholar   +1 more source

Differentially Private Combinatorial Cloud Auction [PDF]

IEEE Transactions on Cloud Computing, 2020
Cloud service providers typically provide different types of virtual machines (VMs) to cloud users with various requirements. Thanks to its effectiveness and fairness, auction has been widely applied in this heterogeneous resource allocation.
Tianjiao Ni, Zhili Chen, Lin Chen, Shun Zhang, Yan Xu, Hong Zhong   +5 more
semanticscholar   +1 more source

Symmetry, Probabiliy, Entropy: Synopsis of the Lecture at MAXENT 2014

Entropy, 2015
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