1004 search results - page 20 / 201 » Product representations of polynomials |
CCCG
1998
13 years 8 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
KBS
2006
13 years 7 months ago
2006
This paper presents a knowledge-intensive support paradigm for platform-based product family design and development. The fundamental issues underlying the product family design an...
IMA
2009
Springer
14 years 1 months ago
2009
Springer
In previous works we considered codes defined as ideals of quotients of skew polynomial rings, so called Ore rings of automorphism type. In this paper we consider codes defined a...
JCP
2007
13 years 7 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
IOR
2008
13 years 7 months ago
2008
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...