11151 search results - page 284 / 2231 » On the Complexity of Model Expansion |
241
click to vote
PODS
1994
ACM
15 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
239
click to vote
BMCBI
2010
2010
Discover Protein Complexes in Protein-Protein Interaction Networks Using Parametric Local Modularity
15 years 7 months ago
Background: Recent advances in proteomic technologies have enabled us to create detailed protein-protein interaction maps in multiple species and in both normal and diseased cells...
286
click to vote
VLDB
2001
ACM
16 years 7 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
214
click to vote
CBMS
2009
IEEE
16 years 2 months ago
2009
IEEE
Feature extraction and selection are two important steps for shape retrieval. Given a data set, a set of features which describe the shape property from different aspects are extr...
176
click to vote
GECCO
2005
Springer
16 years 27 days ago
2005
Springer
Designing technical plants is a complex and demanding process. It has been shown that the optimization of the simple facility placement problem is already NP-hard. Optimization of...