Sciweavers

5329 search results - page 193 / 1066
» The Weighted Majority Algorithm
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
NIPS
2008
15 years 8 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
ICPR
2006
IEEE
16 years 7 months ago
Feature selection based on the training set manipulation
A novel filter feature selection technique is introduced. The method exploits the information conveyed by the evolution of the training samples weights similarly to the Adaboost a...
Pavel Krízek, Josef Kittler, Václav ...
ICML
2005
IEEE
16 years 7 months ago
Multi-class protein fold recognition using adaptive codes
We develop a novel multi-class classification method based on output codes for the problem of classifying a sequence of amino acids into one of many known protein structural class...
Eugene Ie, Jason Weston, William Stafford Noble, C...
WWW
2006
ACM
16 years 7 months ago
Background knowledge for ontology construction
In this paper we describe a solution for incorporating background knowledge into the OntoGen system for semi-automatic ontology construction. This makes it easier for different us...
Blaz Fortuna, Marko Grobelnik, Dunja Mladenic