2698 search results - page 28 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
ICANN
2007
Springer
14 years 1 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
ICALP
2010
Springer
14 years 13 days ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
ISCI
2008
13 years 7 months ago
2008
In this paper, we introduce weights into Pawlak rough set model to balance the class distribution of a data set and develop a weighted rough set based method to deal with the clas...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matchin...