Sciweavers

1296 search results - page 30 / 260
» The Number Field Sieve
Sort
View
FOCM
2008
77views more  FOCM 2008»
13 years 10 months ago
Modular Counting of Rational Points over Finite Fields
Let Fq be the finite field of q elements, where q = ph. Let f(x) be a polynomial over Fq in n variables with m non-zero terms. Let N(f) denote the number of solutions of f(x) = 0 ...
Daqing Wan
OSDI
2008
ACM
14 years 10 months ago
Disk Drive Workload Captured in Logs Collected During the Field Return Incoming Test
Hard disk drives returned back to Seagate undergo the Field Return Incoming Test. During the test, the available logs in disk drives are collected, if possible. These logs contain...
Alma Riska, Erik Riedel
AISC
2008
Springer
13 years 12 months ago
Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
Amine Chaieb
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
13 years 10 months ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
Grégoire Lecerf
EUROGRAPHICS
2010
Eurographics
14 years 7 months ago
Uncertain 2D Vector Field Topology
We introduce an approach to visualize stationary 2D vector fields with global uncertainty obtained by considering the transport of local uncertainty in the flow. For this, we ex...
Mathias Otto, Tobias Germer, Hans-Christian Hege, ...