1996 search results - page 117 / 400 » A decision procedure for linear |
194
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
178
click to vote
COLT
1997
Springer
15 years 10 months ago
1997
Springer
The problem of learning linear discriminant concepts can be solved by various mistake-driven update procedures, including the Winnow family of algorithms and the well-known Percep...
162
click to vote
NCI
2004
15 years 7 months ago
2004
In model selection procedures in supervised learning, a model is usually chosen so that the expected test error over all possible test input points is minimized. On the other hand...
149
click to vote
UAI
2001
15 years 7 months ago
2001
It is "well known" that in linear models: (1) testable constraints on the marginal distribution of observed variables distinguish certain cases in which an unobserved ca...
185
click to vote
TNN
2008
15 years 6 months ago
2008
Abstract--High-dimensional data are common in many domains, and dimensionality reduction is the key to cope with the curse-of-dimensionality. Linear discriminant analysis (LDA) is ...