Sciweavers

1365 search results - page 160 / 273
» Learning with Product Units
Sort
View
120
Voted
ICML
2003
IEEE
16 years 1 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
113
Voted
ICSE
2007
IEEE-ACM
16 years 25 days ago
Software Development Environments for Scientific and Engineering Software: A Series of Case Studies
The need for high performance computing applications for computational science and engineering projects is growing rapidly, yet there have been few detailed studies of the softwar...
Jeffrey C. Carver, Richard P. Kendall, Susan E. Sq...
84
Voted
ALT
2002
Springer
15 years 9 months ago
On the Learnability of Vector Spaces
The central topic of the paper is the learnability of the recursively enumerable subspaces of V∞/V , where V∞ is the standard recursive vector space over the rationals with (c...
Valentina S. Harizanov, Frank Stephan
TCC
2012
Springer
226views Cryptology» more  TCC 2012»
13 years 8 months ago
Subspace LWE
The (decisional) learning with errors problem (LWE) asks to distinguish “noisy” inner products of a secret vector with random vectors from uniform. In recent years, the LWE pro...
Krzysztof Pietrzak
VLSISP
2011
358views Database» more  VLSISP 2011»
14 years 7 months ago
Accelerating Machine-Learning Algorithms on FPGAs using Pattern-Based Decomposition
Machine-learning algorithms are employed in a wide variety of applications to extract useful information from data sets, and many are known to suffer from superlinear increases in ...
Karthik Nagarajan, Brian Holland, Alan D. George, ...