Sciweavers

633 search results - page 121 / 127
» Convergence Models of Genetic Algorithm Selection Schemes
Sort
View
CORR
2011
Springer
159views Education» more  CORR 2011»
13 years 2 months ago
How to Play Unique Games against a Semi-Random Adversary
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
Alexandra Kolla, Konstantin Makarychev, Yury Makar...
JMLR
2011
148views more  JMLR 2011»
13 years 2 months ago
Multitask Sparsity via Maximum Entropy Discrimination
A multitask learning framework is developed for discriminative classification and regression where multiple large-margin linear classifiers are estimated for different predictio...
Tony Jebara
JSAC
2010
138views more  JSAC 2010»
13 years 6 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
CVPR
2005
IEEE
14 years 9 months ago
Local Color Transfer via Probabilistic Segmentation by Expectation-Maximization
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang
SIGCOMM
2005
ACM
14 years 1 months ago
One more bit is enough
Achieving efficient and fair bandwidth allocation while minimizing packet loss in high bandwidth-delay product networks has long been a daunting challenge. Existing endto-end cong...
Yong Xia, Lakshminarayanan Subramanian, Ion Stoica...