1389 search results - page 86 / 278 » Improved Approximation Algorithms for Label Cover Problems |
138
click to vote
BMCBI
2005
15 years 2 months ago
2005
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
108
click to vote
PERCOM
2009
ACM
15 years 10 months ago
2009
ACM
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
117
click to vote
FAW
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
108
click to vote
SIGECOM
2006
ACM
15 years 9 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
122
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...