Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms.
Anton BernshteynPublished in: CoRR (2021)
Keyphrases
- graph theory
- orders of magnitude
- worst case
- times faster
- computational efficiency
- computationally efficient
- learning algorithm
- data structure
- distributed computation
- distributed systems
- computational cost
- cooperative
- bayesian networks
- optimization problems
- peer to peer
- significant improvement
- computationally expensive
- posterior probability
- computer vision
- database