2698 search results - page 394 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
165
click to vote
ICDM
2007
IEEE
16 years 22 days ago
2007
IEEE
We consider the problem of relating itemsets mined on binary attributes of a data set to numerical attributes of the same data. An example is biogeographical data, where the numer...
167
click to vote
IJCAI
2007
15 years 7 months ago
2007
We study the problem of learning large margin halfspaces in various settings using coresets to show that coresets are a widely applicable tool for large margin learning. A large m...
158
click to vote
COMPUTING
2010
15 years 3 months ago
2010
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
162
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We study the problem of designing group-strategyproof costsharing mechanisms. The players report their bids for getting serviced and the mechanism decides a set of player...
166
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...