2698 search results - page 199 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
220
click to vote
ICANN
2010
Springer
15 years 3 months ago
2010
Springer
The aim of this paper is to study the use of Evolutionary Multiobjective Techniques to improve the performance of Neural Networks (NN). In particular, we will focus on classificati...
179
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
187
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Consider the problem of joint parameter estimation and prediction in a Markov random field: i.e., the model parameters are estimated on the basis of an initial set of data, and th...
156
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
185
click to vote
ICA
2007
Springer
15 years 10 months ago
2007
Springer
Independent Component Analysis (ICA) is a statistical method for expressing an observed set of random vectors as a linear combination of statistically independent components. This...