3049 search results - page 314 / 610 » On the Convergence of Bound Optimization Algorithms |
168
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
205
click to vote
TIT
2010
15 years 1 months ago
2010
We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar...
180
click to vote
ANOR
2011
14 years 10 months ago
2011
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
195
click to vote
NN
1998
Springer
15 years 6 months ago
1998
Springer
The relation between hard c-means (HCM), fuzzy c-means (FCM), fuzzy learning vector quantization (FLVQ), soft competition scheme (SCS) of Yair et al. (1992) and probabilistic Gaus...
174
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...