Sciweavers

230 search results - page 15 / 46
» Faster algorithms for the characteristic polynomial
Sort
View
94
Voted
ISSAC
2005
Springer
97views Mathematics» more  ISSAC 2005»
15 years 3 months ago
Probabilistic algorithms for computing resultants
Let A and B be two polynomials in   [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
Michael B. Monagan
ICIP
2010
IEEE
14 years 7 months ago
A fast Multilinear ICA algorithm
We extend our previous work on Multilinear Independent Component Analysis (MICA) by introducing a Fast-MICA algorithm that demonstrates the same improvement over classical ICA as ...
Raghu G. Raj, Alan C. Bovik
ISMIS
2005
Springer
15 years 3 months ago
Incremental Collaborative Filtering for Highly-Scalable Recommendation Algorithms
Most recommendation systems employ variations of Collaborative Filtering (CF) for formulating suggestions of items relevant to users’ interests. However, CF requires expensive co...
Manos Papagelis, Ioannis Rousidis, Dimitris Plexou...
WAIFI
2010
Springer
194views Mathematics» more  WAIFI 2010»
15 years 2 months ago
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
A cryptographic pairing evaluates as an element of a finite extension field, and the evaluation itself involves a considerable amount of extension field arithmetic. It is recogn...
Naomi Benger, Michael Scott
JSC
2010
155views more  JSC 2010»
14 years 8 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan