218 search results - page 6 / 44 » Constant Rate Approximate Maximum Margin Algorithms |
140
click to vote
CATS
2006
15 years 3 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
COCO
2006
Springer
15 years 5 months ago
2006
Springer
We consider the problem of finding a monomial (or a term) that maximizes the agreement rate with a given set of examples over the Boolean hypercube. The problem is motivated by le...
106
click to vote
SIAMCO
2002
15 years 1 months ago
2002
There is a large literature on the rate of convergence problem for general unconstrained stochastic approximations. Typically, one centers the iterate n about the limit point then...
106
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
107
Voted
COLT
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...