Sciweavers

340 search results - page 9 / 68
» ets 2009
Sort
View
APPROX
2009
Springer
145views Algorithms» more  APPROX 2009»
15 years 4 months ago
Approximating Some Network Design Problems with Node Costs
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
Guy Kortsarz, Zeev Nutov
EMNLP
2009
14 years 8 months ago
Cross-lingual Semantic Relatedness Using Encyclopedic Knowledge
In this paper, we address the task of crosslingual semantic relatedness. We introduce a method that relies on the information extracted from Wikipedia, by exploiting the interlang...
Samer Hassan, Rada Mihalcea
JMLR
2010
101views more  JMLR 2010»
14 years 4 months ago
Exploiting Feature Covariance in High-Dimensional Online Learning
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
Justin Ma, Alex Kulesza, Mark Dredze, Koby Crammer...
104
Voted
ALT
2011
Springer
13 years 10 months ago
Deviations of Stochastic Bandit Regret
This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009...
Antoine Salomon, Jean-Yves Audibert
STACS
2010
Springer
15 years 5 months ago
Large-Girth Roots of Graphs
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r + ...
Anna Adamaszek, Michal Adamaszek