1225 search results - page 87 / 245 » The Instance Complexity Conjecture |
ESANN
2006
13 years 10 months ago
2006
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
CONSTRAINTS
2008
13 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
EOR
2007
13 years 9 months ago
2007
act 11 We address the problem of designing a network built on several layers. This problem occurs in practical applications 12 but has not been studied extensively from the point o...
NN
2006
Springer
13 years 9 months ago
2006
Springer
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large ...
TNN
1998
13 years 8 months ago
1998
— In this paper, we study a qualitative property of a class of competitive learning (CL) models, which is called the multiplicatively biased competitive learning (MBCL) model, na...