217 search results - page 35 / 44 » Parameterized algorithms for d-Hitting Set: The weighted cas... |
158
click to vote
WWW
2010
ACM
16 years 28 days ago
2010
ACM
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
174
click to vote
NETWORKS
2010
15 years 4 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
204
click to vote
MOBICOM
2006
ACM
15 years 12 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
242
click to vote
AMAI
2011
Springer
14 years 6 months ago
2011
Springer
A multi-armed bandit episode consists of n trials, each allowing selection of one of K arms, resulting in payoff from a distribution over [0, 1] associated with that arm. We assum...
176
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...