Sciweavers

2570 search results - page 106 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
BROADNETS
2004
IEEE
15 years 1 months ago
A Scalable Algorithm for Survivable Routing in IP-Over-WDM Networks
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...
Frederick Ducatelle, Luca Maria Gambardella
IPPS
2003
IEEE
15 years 3 months ago
A GRASP-Based Algorithm for Solving DVE Partitioning Problem
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
Pedro Morillo, Marcos Fernández
IWOCA
2009
Springer
132views Algorithms» more  IWOCA 2009»
15 years 4 months ago
Fast Convolutions and Their Applications in Approximate String Matching
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...
Kimmo Fredriksson, Szymon Grabowski
CHES
2005
Springer
83views Cryptology» more  CHES 2005»
15 years 3 months ago
Fast Truncated Multiplication for Cryptographic Applications
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...
Laszlo Hars
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
15 years 2 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
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 ...
Erich Kaltofen, Victor Shoup