455 search results - page 28 / 91 » Approximation Algorithms for Partial Covering Problems |
105
click to vote
HICSS
2008
IEEE
14 years 9 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
112
click to vote
ESA
2003
Springer
15 years 2 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
ECML
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a n...
CGF
2006
14 years 9 months ago
2006
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
121
click to vote
SODA
2007
ACM
14 years 11 months ago
2007
ACM
We study the problem of aggregating partial rankings. This problem is motivated by applications such as meta-searching and information retrieval, search engine spam fighting, e-c...