Sciweavers

71228 search results - page 70 / 14246
» Algorithms
Sort
View
WALCOM
2008
IEEE
127views Algorithms» more  WALCOM 2008»
15 years 2 months ago
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs
In this paper, a fast algorithm is proposed to calculate kth power of an n
Md. Abdur Razzaque, Choong Seon Hong, Mohammad Abd...
AAECC
2004
Springer
120views Algorithms» more  AAECC 2004»
15 years 1 months ago
The Middle Product Algorithm I
We present new algorithms for the inverse, division, and square root of power series. The key trick is a new algorithm
Guillaume Hanrot, Michel Quercia, Paul Zimmermann
ICIP
2002
IEEE
16 years 3 months ago
On the structure of some phase retrieval algorithms
The state of the art for solving the phase retrieval problem in two dimensions relies heavily on the algorithms proposed by Gerchberg, Saxton, and Fienup. Despite the widespread u...
Heinz H. Bauschke, Patrick L. Combettes, D. Russel...
ICML
2003
IEEE
16 years 2 months ago
Using Linear-threshold Algorithms to Combine Multi-class Sub-experts
We present a new type of multi-class learning algorithm called a linear-max algorithm. Linearmax algorithms learn with a special type of attribute called a sub-expert. A sub-exper...
Chris Mesterharm
ISSAC
2007
Springer
199views Mathematics» more  ISSAC 2007»
15 years 7 months ago
A sparse modular GCD algorithm for polynomials over algebraic function fields
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan