8933 search results - page 77 / 1787 » Usability over time |
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
107
click to vote
ISSAC
1997
Springer
15 years 4 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
100
click to vote
COMCOM
2002
14 years 11 months ago
2002
This paper studies the transmission control protocol (TCP) performance over a discrete multi-tone (DMT) based asymmetric digital subscriber loop (ADSL) network. The impact of DMT ...
TIME
2008
IEEE
15 years 6 months ago
2008
IEEE
We tackle the issue of representing infinite sets of realvalued vectors. This paper introduces an operator for combining integer and real sets. Using this operator, we decompose ...
FOCS
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...