Sciweavers

524 search results - page 8 / 105
» ets 2010
Sort
View
ENDM
2010
136views more  ENDM 2010»
13 years 7 months ago
Approximating the asymmetric profitable tour
Abstract We study the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such th...
Viet Hung Nguyen, Thi Thu Thuy Nguyen
SIAMCOMP
2010
97views more  SIAMCOMP 2010»
13 years 2 months ago
Lower Bounds for Randomized Consensus under a Weak Adversary
This paper studies the inherent trade-off between termination probability and total step complexity of randomized consensus algorithms. It shows that for every integer k, the prob...
Hagit Attiya, Keren Censor-Hillel
ACL
2010
13 years 5 months ago
A Latent Dirichlet Allocation Method for Selectional Preferences
The computation of selectional preferences, the admissible argument values for a relation, is a well-known NLP task with broad applicability. We present LDA-SP, which utilizes Lin...
Alan Ritter, Mausam, Oren Etzioni
JMLR
2010
93views more  JMLR 2010»
13 years 2 months ago
Erratum: SGDQN is Less Careful than Expected
The SGD-QN algorithm described in (Bordes et al., 2009) contains a subtle flaw that prevents it from reaching its design goals. Yet the flawed SGD-QN algorithm has worked well eno...
Antoine Bordes, Léon Bottou, Patrick Gallin...