560 search results - page 22 / 112 » Multiplication by a Constant is Sublinear |
ARITH
2003
IEEE
14 years 1 months ago
2003
IEEE
We propose an algorithm for modular multiplication/division suitable for VLSI implementation. The algorithm is based on Montgomery’s method for modular multiplication and on the...
IAJIT
2010
13 years 6 months ago
2010
: Warehouses scheduling is the problem of sequencing requests of products to fulfill several customers’ orders so as to minimize the average time and shipping costs. In this pape...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
We describe an algorithmfor reconstructing a scene containing multiple moving objects. Given a monocular image sequence, we recover the scene structure, the trajectories of the mo...
SIPS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper presents an error compensation method for truncated multiplication. From two n-bit operands, the operator produces an n-bit product with small error compared to the 2n-b...
MOC
1998
13 years 7 months ago
1998
We show that the multiple zeta sum: ζ(s1, s2, ..., sd) = n1>n2>...>nd 1 ns1 1 ns2 2 ...n sd d , for positive integers si with s1 > 1, can always be written as a finit...