19 search results - page 2 / 4 » Lattice Structure and Linear Complexity of Nonlinear Pseudor... |
ISSAC
1997
Springer
13 years 9 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
CIKM
1998
Springer
13 years 9 months ago
1998
Springer
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
TSP
2008
13 years 5 months ago
2008
The most popular algorithms for blind equalization are the constant-modulus algorithm (CMA) and the ShalviWeinstein algorithm (SWA). It is well-known that SWA presents a higher co...
IPL
2010
13 years 2 days ago
2010
Balanced Feistel networks (BFN) have been widely used for constructing efficient block ciphers. They are known to provide high efficiency with respect to differential and linear c...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...