Sciweavers

6 search results - page 1 / 2
» New Circular Security Counterexamples from Decision Linear a...
Sort
View
EWRL
2008
13 years 11 months ago
New Error Bounds for Approximations from Projected Linear Equations
We consider linear fixed point equations and their approximations by projection on a low dimensional subspace. We derive new bounds on the approximation error of the solution, whi...
Huizhen Yu, Dimitri P. Bertsekas
STOC
2005
ACM
198views Algorithms» more  STOC 2005»
14 years 9 months ago
On lattices, learning with errors, random linear codes, and cryptography
Our main result is a reduction from worst-case lattice problems such as GAPSVP and SIVP to a certain learning problem. This learning problem is a natural extension of the `learnin...
Oded Regev
ICML
2001
IEEE
14 years 10 months ago
Off-Policy Temporal Difference Learning with Function Approximation
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
Doina Precup, Richard S. Sutton, Sanjoy Dasgupta
ML
2000
ACM
185views Machine Learning» more  ML 2000»
13 years 9 months ago
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms
Twenty-two decision tree, nine statistical, and two neural network algorithms are compared on thirty-two datasets in terms of classification accuracy, training time, and (in the ca...
Tjen-Sien Lim, Wei-Yin Loh, Yu-Shan Shih
ICPR
2006
IEEE
14 years 10 months ago
GMM-based SVM for face recognition
A new face recognition algorithm is presented. It supposes that a video sequence of a person is available both at enrollment and test time. During enrollment, a client Gaussian Mi...
Gérard Chollet, Hervé Bredin, Najim ...