2698 search results - page 116 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
144
click to vote
ANSS
1998
IEEE
15 years 10 months ago
1998
IEEE
In solving application problems, the data sets used to train a neural network may not be hundred percent precise but within certain ranges. Representing data sets with intervals, ...
159
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
213
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Sum rate maximization by power control is an important, challenging, and extensively studied problem in wireless networks. It is a nonconvex optimization problem and ac...
175
click to vote
PODS
2008
ACM
16 years 6 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
160
click to vote
JMLR
2008
15 years 6 months ago
2008
Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classi...