218 search results - page 2 / 44 » Constant Rate Approximate Maximum Margin Algorithms |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
COLT
2003
Springer
14 years 3 days ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
AAIM
2008
Springer
14 years 1 months ago
2008
Springer
This paper deals with the maximum triangle packing problem. For this problem, Hassin and Rubinstein gave a randomized polynomial-time approximation algorithm that achieves an expe...
PROPERTYTESTING
2010
13 years 4 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...