Sciweavers

3875 search results - page 531 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
STOC
1998
ACM
79views Algorithms» more  STOC 1998»
15 years 10 months ago
Multicasting in Heterogeneous Networks
In heterogeneousnetworks sending messagesmay incur different delayson different edges,and eachprocessormay havea different switching timebetweenmessages.Thewell studiedTelephonemo...
Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch S...
170
Voted
EMNLP
2008
15 years 8 months ago
Complexity of Finding the BLEU-optimal Hypothesis in a Confusion Network
Confusion networks are a simple representation of multiple speech recognition or translation hypotheses in a machine translation system. A typical operation on a confusion network...
Gregor Leusch, Evgeny Matusov, Hermann Ney
IJCAI
2007
15 years 8 months ago
Maximum Margin Coresets for Active and Noise Tolerant Learning
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
Sariel Har-Peled, Dan Roth, Dav Zimak
NIPS
2000
15 years 8 months ago
Using Free Energies to Represent Q-values in a Multiagent Reinforcement Learning Task
The problem of reinforcement learning in large factored Markov decision processes is explored. The Q-value of a state-action pair is approximated by the free energy of a product o...
Brian Sallans, Geoffrey E. Hinton
ESA
2010
Springer
203views Algorithms» more  ESA 2010»
15 years 7 months ago
A Complete Characterization of Group-Strategyproof Mechanisms of Cost-Sharing
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
Emmanouil Pountourakis, Angelina Vidali