Sciweavers

40 search results - page 4 / 8
» focs 1999
Sort
View
FOCS
1999
IEEE
13 years 10 months ago
On the Complexity of SAT
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
Richard J. Lipton, Anastasios Viglas
FOCS
1999
IEEE
13 years 10 months ago
Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangular subsets of the hypercubic lattice
Christian Borgs, Jennifer T. Chayes, Alan M. Friez...
COCOON
2001
Springer
13 years 10 months ago
A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
Valerie King, Mikkel Thorup
FOCS
1999
IEEE
13 years 10 months ago
Learning Mixtures of Gaussians
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...
Sanjoy Dasgupta
FOCS
2000
IEEE
13 years 10 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala