1389 search results - page 164 / 278 » Improved Approximation Algorithms for Label Cover Problems |
157
click to vote
TCC
2012
Springer
13 years 10 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
150
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
152
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
130
click to vote
COLT
2003
Springer
15 years 8 months ago
2003
Springer
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
161
click to vote
ICCV
2009
IEEE
15 years 28 days ago
2009
IEEE
Image annotation has been an active research topic in the recent years due to its potentially large impact on both image understanding and web/database image search. In this paper...