3049 search results - page 125 / 610 » On the Convergence of Bound Optimization Algorithms |
130
Voted
NIPS
2007
15 years 6 months ago
2007
Bayesian model averaging, model selection and their approximations such as BIC are generally statistically consistent, but sometimes achieve slower rates of convergence than other...
146
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
In this paper, we present nearly optimal algorithms for broadcast on a d-dimensional nn:::n torus that supports all-port communication and wormhole routing. Let Tn denote the numb...
153
click to vote
ICCAD
1995
IEEE
15 years 8 months ago
1995
IEEE
The traditional algorithm of Stockmeyer for area minimization of slicing
oorplans has time (and space) complexity O(n2 ) in the worst case, or O(nlogn) for balanced slicing. For ...
124
Voted
STOC
1990
ACM
15 years 8 months ago
1990
ACM
We present randomized algorithms for two sorting problems. In the local sorting problem, a graph is given in which each vertex is assigned an element of a total order, and the task...
153
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
We address the problem of finding parallel plans for SQL queries using the two-phase approach of join ordering followed by parallelization. We focus on the parallelization phase a...