3049 search results - page 538 / 610 » On the Convergence of Bound Optimization Algorithms |
108
click to vote
WINE
2009
Springer
15 years 10 months ago
2009
Springer
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
161
click to vote
CEC
2008
IEEE
15 years 10 months ago
2008
IEEE
—This paper presents an eavesdropper-proof algorithm that is capable of fast generating symmetric (secret) keys. Instead of literally exchanging secret keys, both the sender and ...
114
click to vote
ESA
2007
Springer
15 years 10 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
126
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are...
134
click to vote
FOCS
2005
IEEE
15 years 9 months ago
2005
IEEE
We consider the problem of learning mixtures of arbitrary symmetric distributions. We formulate sufficient separation conditions and present a learning algorithm with provable gua...