Sciweavers

10988 search results - page 1706 / 2198
» Algorithmic Folding Complexity
Sort
View
GRC
2010
IEEE
15 years 8 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
ATAL
2010
Springer
15 years 7 months ago
Avoiding the prisoner's dilemma in auction-based negotiations for highly rugged utility spaces
There is a number of recent research lines addressing complex negotiations in highly rugged utility spaces. However, most of them focus on overcoming the problems imposed by the c...
Ivan Marsá-Maestre, Miguel A. López-...
BMCBI
2010
183views more  BMCBI 2010»
15 years 7 months ago
SING: Subgraph search In Non-homogeneous Graphs
Background: Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image unders...
Raffaele Di Natale, Alfredo Ferro, Rosalba Giugno,...
BMCBI
2010
136views more  BMCBI 2010»
15 years 7 months ago
The IronChip evaluation package: a package of perl modules for robust analysis of custom microarrays
Background: Gene expression studies greatly contribute to our understanding of complex relationships in gene regulatory networks. However, the complexity of array design, producti...
Yevhen Vainshtein, Mayka Sanchez, Alvis Brazma, Ma...
BMCBI
2010
131views more  BMCBI 2010»
15 years 7 months ago
A comparison of approximation techniques for variance-based sensitivity analysis of biochemical reaction systems
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...
Hong-Xuan Zhang, John Goutsias
« Prev « First page 1706 / 2198 Last » Next »