2957 search results - page 8 / 592 » The Complexity of Polynomial-Time Approximation |
166
Voted
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we propose a Markov chain for sampling a random vector distributed according to a discretized Dirichlet distribution. We show that our Markov chain is rapi...
124
Voted
FOCS
2000
IEEE
15 years 10 months ago
2000
IEEE
184
Voted
SODA
1998
ACM
15 years 7 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
114
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
128
Voted
JAL
2000
15 years 5 months ago
2000