Sciweavers

2087 search results - page 42 / 418
» Computation of class numbers of quadratic number fields
Sort
View
CSR
2006
Springer
14 years 5 days ago
Complexity of Polynomial Multiplication over Finite Fields
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
Michael Kaminski
ANTS
2004
Springer
93views Algorithms» more  ANTS 2004»
14 years 1 months ago
Nonic 3-adic Fields
We compute all nonic extensions of Q3 and find that there are 795 of them up to isomorphism. We describe how to compute the associated Galois group of such a field, and also the ...
John W. Jones, David P. Roberts
MFCS
2007
Springer
14 years 2 months ago
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
Paul S. Bonsma, Luis Cereceda
ICMCS
2010
IEEE
193views Multimedia» more  ICMCS 2010»
13 years 9 months ago
Motion segmentation in compressed video using Markov Random Fields
In this paper, we propose an unsupervised segmentation algorithm for extracting moving objects/regions from compressed video using Markov Random Field (MRF) classification. First,...
Yue-Meng Chen, Ivan V. Bajic, Parvaneh Saeedi
SAC
2010
ACM
14 years 3 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...