1004 search results - page 10 / 201 » Product representations of polynomials |
CPM
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
PFE
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Product family architectures need to be captured much like “regular” software architectures. Unfortunately, representations for product family architectures are scarc...
NPL
2000
13 years 6 months ago
2000
This paper explores internal representation power of product units [1] that act as the functional nodes in the hidden layer of a multi-layer feedforward network. Interesting proper...
ICALP
2010
Springer
13 years 11 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...