Sciweavers

JC
2007
119views more  JC 2007»
13 years 11 months ago
Factoring bivariate sparse (lacunary) polynomials
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
Martin Avendano, Teresa Krick, Martín Sombr...
JC
2007
62views more  JC 2007»
13 years 11 months ago
On regularization algorithms in learning theory
Frank Bauer, Sergei V. Pereverzev, Lorenzo Rosasco
JC
2007
41views more  JC 2007»
13 years 11 months ago
Pseudorandom numbers and entropy conditions
István Berkes, Walter Philipp, Robert F. Ti...
JC
2007
49views more  JC 2007»
13 years 11 months ago
On the complexity of Putinar's Positivstellensatz
Jiawang Nie, Markus Schweighofer
JC
2007
45views more  JC 2007»
13 years 11 months ago
A primal-dual symmetric relaxation for homogeneous conic systems
Juan Carlos Vera, Juan Carlos Rivera, Javier Pe&nt...
JC
2007
63views more  JC 2007»
13 years 11 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings III: Frames
We study the optimal approximation of the solution of an operator equation A(u) = f by certain n-term approximations with respect to specific classes of frames. We consider worst...
Stephan Dahlke, Erich Novak, Winfried Sickel
JC
2007
57views more  JC 2007»
13 years 11 months ago
Discrepancy with respect to convex polygons
We study the problem of discrepancy of finite point sets in the unit square with respect to convex polygons, when the directions of the edges are fixed, when the number of edges ...
W. W. L. Chen, G. Travaglini
JC
2007
65views more  JC 2007»
13 years 11 months ago
Searching for extensible Korobov rules
Extensible lattice sequences have been proposed and studied in [5–7]. For the special case of extensible Korobov sequences, parameters can be found in [6]. The searches made to ...
Hardeep S. Gill, Christiane Lemieux
JC
2007
101views more  JC 2007»
13 years 11 months ago
Simple Monte Carlo and the Metropolis algorithm
We study the integration of functions with respect to an unknown density. Information is available as oracle calls to the integrand and to the nonnormalized density function. We ar...
Peter Mathé, Erich Novak
JC
2007
96views more  JC 2007»
13 years 11 months ago
Error linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments ...
Wilfried Meidl, Harald Niederreiter, Ayineedi Venk...