554 search results - page 106 / 111 » Approximation algorithms and hardness results for labeled co... |
PKDD
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. One solution to the lack of label problem is to exploit transfer learning, whereby one acquires knowledge from source-domains to improve the learning performance in the t...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We prove strong lower bounds on integrality gaps of Sherali?Adams relaxations for MAX CUT, Vertex Cover, Sparsest Cut and other problems. Our constructions show gaps for Sherali?A...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
VLDB
2008
ACM
14 years 7 months ago
2008
ACM
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...