1554 search results - page 159 / 311 » Parameterized Complexity and Approximation Algorithms |
91
Voted
KDD
2010
ACM
15 years 5 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
147
Voted
JMLR
2010
14 years 10 months ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
151
click to vote
BMCBI
2006
15 years 3 months ago
2006
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
127
Voted
ISNN
2009
Springer
15 years 10 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...
201
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....