Sciweavers

12836 search results - page 299 / 2568
» Generalization Methods in Bioinformatics
Sort
View
NIPS
2008
15 years 6 months ago
Sparse Online Learning via Truncated Gradient
We propose a general method called truncated gradient to induce sparsity in the weights of onlinelearning algorithms with convex loss functions. This method has several essential ...
John Langford, Lihong Li, Tong Zhang
ISBRA
2009
Springer
15 years 11 months ago
Mean Square Residue Biclustering with Missing Data and Row Inversions
Cheng and Church proposed a greedy deletion-addition algorithm to find a given number of k biclusters, whose mean squared residues (MSRs) are below certain thresholds and the miss...
Stefan Gremalschi, Gulsah Altun, Irina Astrovskaya...
CSB
2005
IEEE
135views Bioinformatics» more  CSB 2005»
15 years 10 months ago
Inverse Design of Large Molecules using Linear Diophantine Equations
We have previously developed a method [1] for the inverse design of small ligands. This method can be used to design novel compounds with optimized properties (such as drugs) and ...
Shawn Martin, W. Michael Brown, Jean-Loup Faulon, ...
CSB
2004
IEEE
177views Bioinformatics» more  CSB 2004»
15 years 8 months ago
High-Throughput 3D Structural Homology Detection via NMR Resonance Assignment
One goal of the structural genomics initiative is the identification of new protein folds. Sequence-based structural homology prediction methods are an important means for priorit...
Christopher James Langmead, Bruce Randall Donald
BMCBI
2010
95views more  BMCBI 2010»
15 years 5 months ago
EPSVR and EPMeta: prediction of antigenic epitopes using support vector regression and multiple server results
Background: Accurate prediction of antigenic epitopes is important for immunologic research and medical applications, but it is still an open problem in bioinformatics. The case f...
Shide Liang, Dandan Zheng, Daron M. Standley, Bo Y...