1379 search results - page 201 / 276 » The Complexity of the Annihilating Polynomial |
161
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper considers the problem of low complexity implementation of high-performance semidefinite relaxation (SDR) MIMO detection methods. Currently, most SDR MIMO detectors are...
145
click to vote
ATAL
2007
Springer
16 years 14 days ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
186
click to vote
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
179
click to vote
NIPS
2007
15 years 7 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
180
click to vote
APPROX
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...