Sciweavers

806 search results - page 115 / 162
» Algebraic Structures of B-series
Sort
View
JSC
2008
162views more  JSC 2008»
13 years 7 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...
JSW
2008
105views more  JSW 2008»
13 years 7 months ago
Formal Models for Architecture Aspects and Their Weaving
Aspect-oriented concepts are currently introduced in early stages of software development to achieve better separation of concerns. However, at the architecture level, there exists...
Chunhua Yang, Haiyang Wang
TCOM
2008
155views more  TCOM 2008»
13 years 7 months ago
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach
This paper presents five methods for constructing nonbinary LDPC codes based on finite geometries. These methods result in five classes of nonbinary LDPC codes, one class of cyclic...
Lingqi Zeng, Lan Lan, Ying Yu Tai, Bo Zhou, Shu Li...
ACS
2004
13 years 7 months ago
Pointfree Spectra of Riesz Spaces
One of the best ways of studying ordered algebraic structures is through their spectra. The three well-known spectra usually considered are the Brumfiel, Keimel, and the maximal sp...
M. Mehdi Ebrahimi, A. Karimi, Mojgan Mahmoudi
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
13 years 7 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous