Sciweavers

664 search results - page 4 / 133
» Some results for a class of generalized polynomials
Sort
View
COLT
2010
Springer
13 years 5 months ago
Strongly Non-U-Shaped Learning Results by General Techniques
In learning, a semantic or behavioral U-shape occurs when a learner rst learns, then unlearns, and, nally, relearns, some target concept (on the way to success). Within the framew...
John Case, Timo Kötzing
ENTCS
2008
102views more  ENTCS 2008»
13 years 7 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
SIAMMAX
2010
103views more  SIAMMAX 2010»
13 years 2 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý
COLT
2005
Springer
14 years 28 days ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 11 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...