2924 search results - page 254 / 585 » Lower Bounds in Distributed Computing |
120
Voted
FM
2008
Springer
15 years 5 months ago
2008
Springer
In [?], a practical algorithm for precise interval analysis is provided for which, however, no non-trivial upper complexity bound is known. Here, we present a lower bound by showin...
129
Voted
SDM
2010
SIAM
15 years 5 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...
141
click to vote
NIPS
2008
15 years 5 months ago
2008
We describe a primal-dual framework for the design and analysis of online strongly convex optimization algorithms. Our framework yields the tightest known logarithmic regret bound...
123
click to vote
MP
2008
15 years 4 months ago
2008
Multistage stochastic programs have applications in many areas and support policy makers in finding rational decisions that hedge against unforeseen negative events. In order to en...
132
Voted
ML
2002
ACM
15 years 3 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...