861 search results - page 34 / 173 » Faster integer multiplication |
ISAAC
2010
Springer
13 years 7 months ago
2010
Springer
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
COCOA
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
ICPR
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper, we present a new solution to the problem of appearance matching across multiple nonoverlapping cameras. Objects of interest, pedestrians are represented by a set of...
ISCAS
2006
IEEE
14 years 3 months ago
2006
IEEE
—This paper describes a low cost, low power, versatile computation module that can be used as a coarse-grain building block in multimedia processors. The module, which has a data...
CASC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...