Sciweavers

440 search results - page 47 / 88
» On partial randomness
Sort
View
NIPS
2007
15 years 1 months ago
Semi-Supervised Multitask Learning
A semi-supervised multitask learning (MTL) framework is presented, in which M parameterized semi-supervised classifiers, each associated with one of M partially labeled data mani...
Qiuhua Liu, Xuejun Liao, Lawrence Carin
AAAI
2010
15 years 22 hour ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 12 months ago
On the inner and outer bounds for 2-receiver discrete memoryless broadcast channels
We study the best known general inner bound[1] and outer bound[2] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bou...
Chandra Nair, Zizhou Vincent Wang
75
Voted
CN
2006
98views more  CN 2006»
14 years 12 months ago
Internet resiliency to attacks and failures under BGP policy routing
We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The ag...
Danny Dolev, Sugih Jamin, Osnat Mokryn, Yuval Shav...
CORR
2006
Springer
132views Education» more  CORR 2006»
14 years 12 months ago
Cross-Entropy method: convergence issues for extended implementation
The cross-entropy method (CE) developed by R. Rubinstein is an elegant practical principle for simulating rare events. The method approximates the probability of the rare event by...
Frédéric Dambreville