2084 search results - page 119 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
94
Voted
ALT
2010
Springer
15 years 4 months ago
2010
Springer
We further develop the idea that the PAC-Bayes prior can be informed by the data-generating distribution. We prove sharp bounds for an existing framework of Gibbs algorithms, and ...
123
click to vote
ICDCS
2007
IEEE
15 years 9 months ago
2007
IEEE
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
151
click to vote
NIPS
2000
15 years 4 months ago
2000
Jensen's inequality is a powerful mathematical tool and one of the workhorses in statistical learning. Its applications therein include the EM algorithm, Bayesian estimation ...
138
Voted
ICCAD
1995
IEEE
15 years 6 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 ...
120
Voted
CSCLP
2005
Springer
15 years 8 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...