Sciweavers

4255 search results - page 119 / 851
» On Learning Boolean Functions
Sort
View
NIPS
2007
14 years 11 months ago
A General Boosting Method and its Application to Learning Ranking Functions for Web Search
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
Zhaohui Zheng, Hongyuan Zha, Tong Zhang, Olivier C...
RECOMB
2005
Springer
15 years 10 months ago
Predicting Protein-Peptide Binding Affinity by Learning Peptide-Peptide Distance Functions
Many important cellular response mechanisms are activated when a peptide binds to an appropriate receptor. In the immune system, the recognition of pathogen peptides begins when th...
Chen Yanover, Tomer Hertz
BMCBI
2006
111views more  BMCBI 2006»
14 years 10 months ago
PepDist: A New Framework for Protein-Peptide Binding Prediction based on Learning Peptide Distance Functions
Background: Many different aspects of cellular signalling, trafficking and targeting mechanisms are mediated by interactions between proteins and peptides. Representative examples...
Tomer Hertz, Chen Yanover
RECOMB
2007
Springer
15 years 10 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
NIPS
1990
14 years 11 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro