Sciweavers

6568 search results - page 1287 / 1314
» Reducing the Complexity of Reductions
Sort
View
BMCBI
2006
175views more  BMCBI 2006»
15 years 6 months ago
Parameter estimation for stiff equations of biosystems using radial basis function networks
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
Yoshiya Matsubara, Shinichi Kikuchi, Masahiro Sugi...
BMCBI
2006
152views more  BMCBI 2006»
15 years 6 months ago
A two-stage approach for improved prediction of residue contact maps
Background: Protein topology representations such as residue contact maps are an important intermediate step towards ab initio prediction of protein structure. Although improvemen...
Alessandro Vullo, Ian Walsh, Gianluca Pollastri
BMCBI
2006
124views more  BMCBI 2006»
15 years 6 months ago
HybGFS: a hybrid method for genome-fingerprint scanning
Background: Protein identification based on mass spectrometry (MS) has previously been performed using peptide mass fingerprinting (PMF) or tandem MS (MS/MS) database searching. H...
Kosaku Shinoda, Nozomu Yachie, Takeshi Masuda, Nao...
207
Voted
COMGEO
2006
ACM
15 years 6 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
CORR
2006
Springer
113views Education» more  CORR 2006»
15 years 6 months ago
A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
Manuel Loth, Philippe Preux
« Prev « First page 1287 / 1314 Last » Next »