4714 search results - page 577 / 943 » The Complexity of Iterated Multiplication |
140
click to vote
ISICA
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
187
click to vote
ISSAC
2007
Springer
16 years 29 days ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
153
click to vote
SPIRE
2007
Springer
16 years 28 days ago
2007
Springer
The Longest Common Subsequence (LCS) is a well studied problem, having a wide range of implementations. Its motivation is in comparing strings. It has long been of interest to dev...
172
click to vote
APCCAS
2006
IEEE
16 years 27 days ago
2006
IEEE
—The Massey-Omura multiplier is a well-known sequential multiplier over finite fields GF(2m ), which can perform multiplication in m clock cycles for the normal basis. In this ar...
174
click to vote
CVPR
2006
IEEE
16 years 27 days ago
2006
IEEE
This paper describes a new approach to motion estimation in video. We represent video motion using a set of particles. Each particle is an image point sample with a longduration t...