3049 search results - page 522 / 610 » On the Convergence of Bound Optimization Algorithms |
ICALP
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we c...
SAMOS
2007
Springer
14 years 3 months ago
2007
Springer
When peak performance is unnecessary, Dynamic Voltage Scaling (DVS) can be used to reduce the dynamic power consumption of embedded multiprocessors. In future technologies, however...
ISMVL
2006
IEEE
14 years 2 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...
INFOCOM
2005
IEEE
14 years 2 months ago
2005
IEEE
— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those...
ECML
2005
Springer
14 years 2 months ago
2005
Springer
We study estimation of mixture models for problems in which multiple views of the instances are available. Examples of this setting include clustering web pages or research papers ...