Sciweavers

7106 search results - page 402 / 1422
» Restricted Complexity, General Complexity
Sort
View
CORR
2007
Springer
78views Education» more  CORR 2007»
15 years 6 months ago
GLRT-Optimal Noncoherent Lattice Decoding
Abstract—This paper presents new low-complexity lattice-decoding algorithms for noncoherent block detection of quadrature amplitude modulation (QAM) and pulse amplitude modulatio...
Daniel J. Ryan, Iain B. Collings, I. Vaughan L. Cl...
ACTA
2002
111views more  ACTA 2002»
15 years 6 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht
189
Voted
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 6 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
CGF
2000
106views more  CGF 2000»
15 years 6 months ago
Constructive Volume Geometry
: Having evolved from volume visualisation, volume graphics is emerging as an important sub-field of computer graphics. This paper focuses on a fundamental aspect of volume graphic...
Min Chen, J. V. Tucker
139
Voted
CORR
2002
Springer
87views Education» more  CORR 2002»
15 years 6 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...