STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Approximately counting integral flows and cell-bounded contingency tables
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Online convex optimization in the bandit setting: gradient descent without a gradient
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Counting without sampling: new algorithms for enumeration problems using statistical physics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Accelerating simulated annealing for the permanent and combinatorial counting problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Blocking Conductance and Mixing in Random Walks
Combinatorics, Probability and Computing
Algorithms for portfolio management based on the Newton method
ICML '06 Proceedings of the 23rd international conference on Machine learning
Graph model selection using maximum likelihood
ICML '06 Proceedings of the 23rd international conference on Machine learning
Mathematical aspects of mixing times in Markov chains
Foundations and Trends® in Theoretical Computer Science
Logarithmic regret algorithms for online convex optimization
Machine Learning
Sampling Hypersurfaces through Diffusion
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Random Structures & Algorithms
The computational complexity of estimating MCMC convergence time
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Pattern discrete and mixed Hit-and-Run for global optimization
Journal of Global Optimization
Logarithmic regret algorithms for online convex optimization
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Submodular maximization by simulated annealing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Calculating probabilities of real-time test cases
FATES'05 Proceedings of the 5th international conference on Formal Approaches to Software Testing
Query strategies for evading convex-inducing classifiers
The Journal of Machine Learning Research
Volume computation using a direct monte carlo method
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
We present a new algorithm for computing the volume of a convex body in \mathbb{R}^n. The main ingredient of the algorithm is a "morphing" technique that can be viewed as a variant of simulated annealing. Its complexity is 0*(n4), improving on the previous best algorithm by a factor of n.