1055 search results - page 95 / 211 » Convex Factorization Machines |
107
click to vote
CORR
2008
Springer
15 years 22 days ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
129
Voted
COLT
2003
Springer
15 years 5 months ago
2003
Springer
The application of statistical methods to natural language processing has been remarkably successful over the past two decades. But, to deal with recent problems arising in this ï¬...
87
Voted
ESA
2003
Springer
15 years 5 months ago
2003
Springer
In [2] it was shown that the obvious semi-clairvoyant generalization of the Shortest Processing Time is O(1)-competitive with respect to average stretch on a single machine. In [2...
124
Voted
FSTTCS
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
118
Voted
ICML
2007
IEEE
16 years 1 months ago
2007
IEEE
A geometric and non parametric procedure for testing if two nite set of points are linearly separable is proposed. The Linear Separability Test is equivalent to a test that deter...