901 search results - page 57 / 181 » Analyzing linear mergers |
170
click to vote
COLT
1998
Springer
15 years 10 months ago
1998
Springer
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
152
Voted
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper is motivated to improve the performance of individual ensembles using a hybrid mechanism in the regression setting. Based on an error-ambiguity decomposition, we formal...
156
click to vote
APPROX
2006
Springer
15 years 10 months ago
2006
Springer
Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
196
click to vote
EUROCRYPT
2000
Springer
15 years 9 months ago
2000
Springer
In a series of papers Patarin proposes new efficient public key systems. A very interesting proposal, called 2-Round Public Key System with S Boxes, or 2R, is based on the difficul...
157
Voted
ISSAC
1995
Springer
15 years 9 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...