2698 search results - page 118 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
204
click to vote
SIGIR
2003
ACM
15 years 11 months ago
2003
ACM
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics ...
154
click to vote
ESA
2009
Springer
16 years 29 days ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...
174
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
158
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
161
click to vote
IPCO
1998
15 years 7 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...