494 search results - page 83 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
161
click to vote
STOC
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
169
click to vote
ECCV
2004
Springer
15 years 11 months ago
2004
Springer
The null space of the within-class scatter matrix is found to express most discriminative information for the small sample size problem (SSSP). The null space-based LDA takes full ...
195
click to vote
NIPS
1996
15 years 7 months ago
1996
To obtain classification systems with both good generalizat`ion performance and efficiency in space and time, we propose a learning method based on combinations of weak classifiers...
145
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
139
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multipleoutput (MIMO) system, wherein each user may receive more than one data stream. We ...