Search Sciweavers | Sciweavers

793 search results - page 6 / 159

» Efficient computation of the characteristic polynomial

click to vote

WSC
2000

125views Modeling And Simulation» more WSC 2000»

A new class of linear feedback shift register generators

13 years 8 months ago

Download www.informs-sim.org

An efficient implementation of linear feedback shift register sequences with a given characteristic polynomial is obtained by a new method. It involves a polynomial linear congrue...

Pierre L'Ecuyer, François Panneton

claim paper

Read More »

click to vote

JSC
2002

61views more JSC 2002»

Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm

13 years 7 months ago

Download www.loria.fr

This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in subquadratic time. This algorithm applies in ...

Emmanuel Thomé

claim paper

Read More »

click to vote

JSC
2006

64views more JSC 2006»

Computing the support of local cohomology modules

13 years 7 months ago

Download www.math.uic.edu

For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...

Josep Àlvarez Montaner, Anton Leykin

claim paper

Read More »

click to vote

DIS
2007
Springer

97views Theoretical Computer Science» more DIS 2007»

An Efficient Polynomial Delay Algorithm for Pseudo Frequent Itemset Mining

13 years 11 months ago

Download research.nii.ac.jp

Takeaki Uno, Hiroki Arimura

claim paper

Read More »