2570 search results - page 106 / 514 » Fast Algorithms For The Computation Of Ranklets |
131
Voted
BROADNETS
2004
IEEE
15 years 7 months ago
2004
IEEE
In IP-over-WDM networks, a logical IP network has to be routed on top of a physical optical fiber network. An important challenge hereby is to make the routing survivable. We call...
121
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
140
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
We develop a method for performing boolean convolutions efficiently in word RAM model of computation, having a word size of w = Ω(log n) bits, where n is the input size. The tech...
129
Voted
CHES
2005
Springer
15 years 9 months ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
144
Voted
ISSAC
1997
Springer
15 years 7 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...