On the Equivalence of Weak Learnability and Linear Separability: New Relaxations and Efficient Boosting Algorithms