Sciweavers

1390 search results - page 164 / 278
» On the Algebraic Structure of Convergence
Sort
View
JSW
2008
105views more  JSW 2008»
15 years 6 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»
15 years 6 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
15 years 6 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»
15 years 6 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
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 6 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy