Sciweavers

414 search results - page 37 / 83
» On discrete norms of polynomials
Sort
View
IJCNN
2006
IEEE
14 years 4 months ago
Learning to Rank by Maximizing AUC with Linear Programming
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...
Kaan Ataman, W. Nick Street, Yi Zhang
EUROCRYPT
2003
Springer
14 years 3 months ago
The GHS Attack Revisited
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...
Florian Hess
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
14 years 1 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé
COLT
2010
Springer
13 years 8 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia
JSCIC
2010
57views more  JSCIC 2010»
13 years 4 months ago
A Proof of the Stability of the Spectral Difference Method for All Orders of Accuracy
While second order methods for computational simulations of fluid flow provide the basis of widely used commercial software, there is a need for higher order methods for more accur...
Antony Jameson