Sciweavers

605 search results - page 8 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
COMGEO
1999
ACM
13 years 7 months ago
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
Sunil Arya, David M. Mount, Michiel H. M. Smid
BMCBI
2007
128views more  BMCBI 2007»
13 years 7 months ago
A robust and efficient algorithm for the shape description of protein structures and its application in predicting ligand bindin
Background: An accurate description of protein shape derived from protein structure is necessary to establish an understanding of protein-ligand interactions, which in turn will l...
Lei Xie, Philip E. Bourne
NIPS
1994
13 years 9 months ago
Boosting the Performance of RBF Networks with Dynamic Decay Adjustment
Radial Basis Function (RBF) Networks, also known as networks of locally{tuned processing units (see 6]) are well known for their ease of use. Most algorithms used to train these t...
Michael R. Berthold, Jay Diamond
JCB
2000
90views more  JCB 2000»
13 years 7 months ago
Geometric Invariant Core for the CL and CH1 Domains of Immunoglobulin Molecules
A previously developed algorithmic method for identifying a geometric invariant of protein structures, termed geometrical core, is extended to the and 1 domains of immunoglobulin ...
Ognyan Stoyanov, Alexander Kister, Israel Gelfand,...
BIBM
2008
IEEE
172views Bioinformatics» more  BIBM 2008»
14 years 2 months ago
Boosting Methods for Protein Fold Recognition: An Empirical Comparison
Protein fold recognition is the prediction of protein’s tertiary structure (Fold) given the protein’s sequence without relying on sequence similarity. Using machine learning t...
Yazhene Krishnaraj, Chandan K. Reddy