Sciweavers

861 search results - page 63 / 173
» Faster integer multiplication
Sort
View
SYNASC
2005
IEEE
117views Algorithms» more  SYNASC 2005»
14 years 3 months ago
Functional-Based Synthesis of Systolic Online Multipliers
— Systolic online algorithms for the multiplication of univariate polynomials and of multiple precision integers are synthesised using a novel method based on the following funct...
Tudor Jebelean, Laura Szakacs
ECWEB
2003
Springer
104views ECommerce» more  ECWEB 2003»
14 years 3 months ago
e-Procurement Using Goal Programming
Abstract. e-Procurement is an Internet-based business process for obtaining materials and services and managing their inflow into the organization. In this paper we develop multia...
S. Kameshwaran, Y. Narahari
FPL
2006
Springer
66views Hardware» more  FPL 2006»
14 years 1 months ago
Minimizing Communication Cost for Reconfigurable Slot Modules
We discuss the problem of communication-aware module placement in array-like reconfigurable environments, such as the Erlangen Slot Machine (ESM). Bad placement of modules may deg...
Sándor P. Fekete, Jan van der Veen, Mateusz...
ASIACRYPT
2008
Springer
14 years 5 days ago
Speeding Up the Pollard Rho Method on Prime Fields
Abstract. We propose a method to speed up the r-adding walk on multiplicative subgroups of the prime field. The r-adding walk is an iterating function used with the Pollard rho alg...
Jung Hee Cheon, Jin Hong, Minkyu Kim
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 10 months ago
Simulation vs. Equivalence
For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is c...
Zoltán Ésik, Andreas Maletti