4781 search results - page 72 / 957 » Complexity at large |
STACS
2001
Springer
14 years 1 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
TSP
2008
13 years 8 months ago
2008
In this paper, we address the joint data-aided estimation of frequency offsets and channel coefficients in uplink MIMO-OFDMA systems. As the Maximum Likelihood (ML) estimator is i...
ICRA
2009
IEEE
14 years 3 months ago
2009
IEEE
— Simultaneous localization and mapping (SLAM) is a well-studied problem in mobile robotics. However, the majority of the proposed techniques for SLAM rely on the use of accurate...
EDBT
2000
ACM
14 years 17 days ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
TNN
2010
13 years 3 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...