Sciweavers

2373 search results - page 301 / 475
» Complexities for generalized models of self-assembly
Sort
View
BMCBI
2008
211views more  BMCBI 2008»
15 years 6 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
ISCI
2008
165views more  ISCI 2008»
15 years 6 months ago
Support vector regression from simulation data and few experimental samples
This paper considers nonlinear modeling based on a limited amount of experimental data and a simulator built from prior knowledge. The problem of how to best incorporate the data ...
Gérard Bloch, Fabien Lauer, Guillaume Colin...
ICML
2004
IEEE
16 years 7 months ago
The Bayesian backfitting relevance vector machine
Traditional non-parametric statistical learning techniques are often computationally attractive, but lack the same generalization and model selection abilities as state-of-the-art...
Aaron D'Souza, Sethu Vijayakumar, Stefan Schaal
WWW
2008
ACM
16 years 7 months ago
Structured objects in owl: representation and reasoning
Applications of semantic technologies often require the representation of and reasoning with structured objects--that is, objects composed of parts connected in complex ways. Alth...
Boris Motik, Bernardo Cuenca Grau, Ulrike Sattler
MOBIHOC
2009
ACM
16 years 7 months ago
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
Mathieu Leconte, Jian Ni, Rayadurgam Srikant