507 search results - page 23 / 102 » Computing Sparse Multiples of Polynomials |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we describe the design of a C library named PTPol implementing arithmetic operations for univariate polynomials and report on practical experiments showing the rele...
QOSIP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
IJHPCA
2006
13 years 7 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
ISSAC
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
ISVC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present an approach for articulated motion detection and pose estimation that uses only motion information. To estimate the pose and viewpoint we introduce a novel mot...