Sciweavers

1695 search results - page 59 / 339
» Linear, Polynomial or Exponential
Sort
View
ESA
2006
Springer
94views Algorithms» more  ESA 2006»
15 years 7 months ago
Contention Resolution with Heterogeneous Job Sizes
Abstract. We study the problem of contention resolution for differentsized jobs on a simple channel. When a job makes a run attempt, it learns only whether the attempt succeeded or...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
ICASSP
2008
IEEE
15 years 10 months ago
Doppler-variant modeling of the vocal tract
A common technique to deploy linear prediction to nonstationary signals is time segmentation and local analysis. In [1], the temporal changes of linear prediction coefficients (L...
Axel Heim, Uli Sorger, Florian Hug
SIAMJO
2010
47views more  SIAMJO 2010»
14 years 10 months ago
Integer Programming Subject to Monomial Constraints
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
Christoph Buchheim, Dennis Michaels, Robert Weisma...
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 9 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
JSC
2000
69views more  JSC 2000»
15 years 3 months ago
Generic Polynomials with Few Parameters
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
Gregor Kemper, Elena Mattig