Sciweavers

29908 search results - page 252 / 5982
» On the Complexity of
Sort
View
JSAT
2007
63views more  JSAT 2007»
15 years 6 months ago
The Complexity of Some Subclasses of Minimal Unsatis able Formulas
This paper is concerned with the complexity of some natural subclasses of minimal unsatisfiable formulas. We show the DP –completeness of the classes of maximal and marginal mi...
Hans Kleine Büning, Xishun Zhao
TWC
2008
107views more  TWC 2008»
15 years 6 months ago
A low complexity user scheduling algorithm for uplink multiuser MIMO systems
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-i...
Yangyang Zhang, Chunlin Ji, Yi Liu, Wasim Q. Malik...
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
IJCV
2000
110views more  IJCV 2000»
15 years 6 months ago
A Parametric Texture Model Based on Joint Statistics of Complex Wavelet Coefficients
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...
Javier Portilla, Eero P. Simoncelli
MOC
1998
71views more  MOC 1998»
15 years 6 months ago
Factorizing complex symmetric matrices with positive definite real and imaginary parts
Complex symmetric matrices whose real and imaginary parts are positive definite are shown to have a growth factor bounded by 2 for LU factorization. This result adds to the classe...
Nicholas J. Higham